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 A251764 #15 Mar 28 2025 11:08:07
%S A251764 0,0,0,1,0,0,0,0,0,0,1,2,4,8,15,30,60,120,240,480,960,1919,3836,7668,
%T A251764 15328,30641,61252,122444,244768,489296,978112,1955264,3908609,
%U A251764 7813382,15619096,31222864,62415087,124768922,249415400,498586032,996682768,1992387424
%N A251764 10-step Fibonacci sequence starting with 0,0,0,1,0,0,0,0,0,0.
%H A251764 <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 A251764 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 A251764 G.f.: x^3*(-1+x+x^2+x^3+x^4+x^5+x^6)/(-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 A251764 LinearRecurrence[Table[1, {10}], {0, 0, 0, 1, 0, 0, 0, 0, 0, 0}, 45] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251764 Other 10-step Fibonacci sequences are A251759, A251760, A251761, A251762, A251763, A251765, A251766.
%K A251764 nonn,easy
%O A251764 0,12
%A A251764 _Arie Bos_, Dec 07 2014