This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A251766 #14 Mar 28 2025 11:08:17
%S A251766 0,1,0,0,0,0,0,0,0,0,1,2,3,6,12,24,48,96,192,384,768,1535,3068,6133,
%T A251766 12260,24508,48992,97936,195776,391360,782336,1563904,3126273,6249478,
%U A251766 12492823,24973386,49922264,99795536,199493136,398790496,797189632,1593596928
%N A251766 10-step Fibonacci sequence starting with 0,1,0,0,0,0,0,0,0,0.
%H A251766 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1,1,1).
%F A251766 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).
%F A251766 G.f.: x*(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8)/(-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
%t A251766 LinearRecurrence[Table[1, {10}], {0, 1, 0, 0, 0, 0, 0, 0, 0, 0}, 45] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251766 Other 10-step Fibonacci sequences are A251759, A251760, A251761, A251762, A251763, A251764, A251765.
%K A251766 nonn,easy
%O A251766 0,12
%A A251766 _Arie Bos_, Dec 07 2014