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