A251706 6-step Fibonacci sequence starting with (0,0,0,0,1,0).

0, 0, 0, 0, 1, 0, 1, 2, 4, 8, 16, 31, 62, 123, 244, 484, 960, 1904, 3777, 7492, 14861, 29478, 58472, 115984, 230064, 456351, 905210, 1795559, 3561640, 7064808, 14013632, 27797200, 55138049, 109370888, 216946217, 430330794, 853596780, 1693179928, 3358562656

Offset

0,8

Comments

a(n+6) equals the number of n-length binary words avoiding runs of zeros of lengths 6i+5, (i=0,1,2,...). - Milan Janjic, Feb 26 2015

Links

Table of n, a(n) for n=0..38.

Index entries for linear recurrences with constant coefficients, signature (1,1,1,1,1,1)

Formula

a(n+6) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5).

Mathematica

LinearRecurrence[Table[1, {6}], {0, 0, 0, 0, 1, 0}, 40] (* Michael De Vlieger, Dec 09 2014 *)

Crossrefs

Other 6-step Fibonacci sequences are A001592, A074584, A251706, A251707, A251708, A251709.

Sequence in context: A003240 A280543 A282566 * A251711 A251741 A018487

Adjacent sequences: A251703 A251704 A251705 * A251707 A251708 A251709

Keyword

nonn,easy

Author

Arie Bos, Dec 07 2014

Status

approved