Let i be in {1,2,3}, let r >= 0 be an integer and n=2*r+i-1. Then a(n)=a(2*r+i-1) gives the quantity of H_(7,1,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x=sqrt((2*cos(Pi/7))^2-1).
(Start) See A187070 for supporting theory. Define the matrix
U_2=
(0 0 1)
(0 1 1)
(1 1 1).
Let r>=0, and let A_r be the r-th "block" defined by A_r={a(2*r),a(2*r+1),a(2*r+2)}. Note that A_r-2*A_(r-1)-A_(r-2)+A_(r-3)={0,0,0}. Let n=2*r+i-1 and M=(m_(i,j))=(U_2)^r. Then A_r corresponds component-wise to the first column of M, and a(n)=a(2*r+i-1)=m_(i,1) gives the quantity of H_(7,1,0) tiles that should appear in a subdivided H_(7,i,r) tile. (End)
Since a(2*r+2)=a(2*(r+1)) for all r, this sequence arises by concatenation of first-column entries m_(1,1) and m_(2,1) from successive matrices M=(U_2)^r.
This sequence is a nontrivial extension of both A038196 and A187070.