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

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 2, 4, 8, 16, 32, 64, 128, 255, 510, 1020, 2039, 4076, 8148, 16288, 32560, 65088, 130112, 260096, 519937, 1039364, 2077708, 4153377, 8302678, 16597208, 33178128, 66323696, 132582304, 265034496, 529808896, 1059097855, 2117156346

Offset: 0

Author

Arie Bos, Dec 07 2014

Keywords

• nonn
• easy

Links

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

Crossrefs

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

Programs

Mathematica

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

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

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

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