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

0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 4, 8, 16, 32, 63, 126, 252, 503, 1004, 2004, 4000, 7984, 15936, 31809, 63492, 126732, 252961, 504918, 1007832, 2011664, 4015344, 8014752, 15997695, 31931898, 63737064, 127221167, 253937416, 506867000, 1011722336, 2019429328

Offset: 0

Author

Arie Bos, Dec 07 2014

Keywords

• nonn
• easy

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)

Crossrefs

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

Programs

Mathematica

LinearRecurrence[Table[1, {8}], {0, 0, 0, 0, 0, 1, 0, 0}, 43] (* Michael De Vlieger, Dec 08 2014 *)

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).

G.f.: x^5*(-1+x+x^2)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8) . - R. J. Mathar, Mar 28 2025

a(n) = A079262(n+2)-A079262(n+1)-A079262(n). - R. J. Mathar, Mar 28 2025