An unbiased coin is tossed n times and the resulting sequence of heads and tails is written linearly. Number of strings out of 2^n possible strings, having no three consecutive heads (HHH's) is given by the above sequence (with suitable offset).
Starting (1, 1, 2, 4, 7, ...) = INVERT transform of (1, 1, 0, 1, 1, 1, 1, ...). - Gary W. Adamson, Apr 27 2009
a(n) is the number of compositions of n avoiding the part 4. - Joerg Arndt, Jul 13 2014
a(5)=14 counts all 2^4 = 16 sequences on {H,T} except HHHT and THHH. We note that coin flip sequences with more than 3 consecutive H's are included in this count. In particular a(5)=14 includes HHHH. Cf. A049856 (comment by Alois P. Heinz) where sequences having no H runs of length 2 are counted. - Geoffrey Critzer, Jan 22 2014
MATHEMATICA
Table[SeriesCoefficient[Series[(1 - x - x^2 + x^4 - x^5)/(1 - 2*x + x^4 - x^5), {x, 0, 34}], n], {n, 0, 34}] (* L. Edson Jeffery, Aug 02 2014 *)
LinearRecurrence[{2, 0, 0, -1, 1}, {1, 1, 1, 2, 4, 7}, 40] (* Harvey P. Dale, Mar 21 2018 *)