OFFSET
0,10
COMMENTS
a(n+8) equals the number of n-length binary words avoiding runs of 0's of lengths 8i+7, (i=0,1,2,...). - Milan Janjic, Feb 26 2015
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1,1,1).
FORMULA
a(n+8) = a(n) +a(n+1) +a(n+2) +a(n+3) +a(n+4) +a(n+5) +a(n+6) +a(n+7).
MATHEMATICA
LinearRecurrence[Table[1, {8}], {0, 0, 0, 0, 0, 0, 1, 0}, 43] (* Michael De Vlieger, Dec 09 2014 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Arie Bos, Dec 06 2014
STATUS
approved