login
A251746
9-step Fibonacci sequence starting with 0,0,0,0,0,0,0,1,0.
8
0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 4, 8, 16, 32, 64, 128, 255, 510, 1019, 2036, 4068, 8128, 16240, 32448, 64832, 129536, 258817, 517124, 1033229, 2064422, 4124776, 8241424, 16466608, 32900768, 65736704, 131343872, 262428927, 524340730, 1047648231, 2093232040
OFFSET
0,11
COMMENTS
a(n+9) equals the number of n-length binary words avoiding runs of zeros of lengths 9i+8, (i=0,1,2,...). - Milan Janjic, Feb 26 2015
FORMULA
a(n+9) = 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).
MATHEMATICA
LinearRecurrence[Table[1, {9}], {0, 0, 0, 0, 0, 0, 0, 1, 0}, 44] (* Michael De Vlieger, Dec 09 2014 *)
CROSSREFS
Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251747, A251748, A251749, A251750, A251751, A251752.
Cf. A255530 (Indices of primes in this sequence).
Sequence in context: A234589 A079262 A194631 * A251760 A243086 A087079
KEYWORD
nonn,easy
AUTHOR
Arie Bos, Dec 07 2014
STATUS
approved