A251672 8-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0.

0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 4, 8, 16, 32, 64, 127, 254, 507, 1012, 2020, 4032, 8048, 16064, 32064, 64001, 127748, 254989, 508966, 1015912, 2027792, 4047536, 8079008, 16125952, 32187903, 64248058, 128241127, 255973288, 510930664, 1019833536, 2035619536

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

Other 8-step Fibonacci sequences are A079262, A105754, A251740, A251741, A251742, A251744, A251745.

Sequence in context: A066178 A122189 A194630 * A251747 A251761 A133024

Adjacent sequences: A251669 A251670 A251671 * A251673 A251674 A251675

Keyword

nonn,easy

Author

Arie Bos, Dec 06 2014

Status

approved