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 A251763 #16 Mar 28 2025 11:07:46
%S A251763 0,0,0,0,1,0,0,0,0,0,1,2,4,8,16,31,62,124,248,496,992,1983,3964,7924,
%T A251763 15840,31664,63297,126532,252940,505632,1010768,2020544,4039105,
%U A251763 8074246,16140568,32265296,64498928,128934559,257742586,515232232,1029958832,2058906896
%N A251763 10-step Fibonacci sequence starting with 0,0,0,0,1,0,0,0,0,0.
%H A251763 <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 A251763 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 A251763 G.f.: x^4*(-1+x+x^2+x^3+x^4+x^5)/(-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 A251763 LinearRecurrence[Table[1, {10}], {0, 0, 0, 0, 1, 0, 0, 0, 0, 0}, 45] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251763 Other 10-step Fibonacci sequences are A251759, A251760, A251761, A251762, A251764, A251765, A251766.
%K A251763 nonn,easy
%O A251763 0,12
%A A251763 _Arie Bos_, Dec 07 2014