A251759 10-step Fibonacci sequence starting with 0,0,0,0,0,0,0,0,1,0.

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 2, 4, 8, 16, 32, 64, 128, 256, 511, 1022, 2043, 4084, 8164, 16320, 32624, 65216, 130368, 260608, 520960, 1041409, 2081796, 4161549, 8319014, 16629864, 33243408, 66454192, 132843168, 265555968, 530851328, 1061181696, 2121321983

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

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

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

Other 10-step Fibonacci sequences are A251760, A251761, A251762, A251763, A251764, A251765, A251766.

Sequence in context: A258800 A194632 A282584 * A243087 A123464 A113019

Adjacent sequences: A251756 A251757 A251758 * A251760 A251761 A251762

Keyword

nonn,easy

Author

Arie Bos, Dec 07 2014

Status

approved