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 A251761 #20 Mar 28 2025 11:07:36
%S A251761 0,0,0,0,0,0,1,0,0,0,1,2,4,8,16,32,64,127,254,508,1016,2031,4060,8116,
%T A251761 16224,32432,64832,129600,259073,517892,1035276,2069536,4137041,
%U A251761 8270022,16531928,33047632,66062832,132060832,263992064,527725055,1054932218,2108829160
%N A251761 10-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0,0,0.
%H A251761 <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 A251761 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 A251761 G.f.: x^6*(-1+x+x^2+x^3)/(-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 A251761 LinearRecurrence[Table[1, {10}], {0, 0, 0, 0, 0, 0, 1, 0, 0, 0}, 45] (* _Michael De Vlieger_, Dec 08 2014 *)
%Y A251761 Other 10-step Fibonacci sequences are A251759, A251760, A251762, A251763, A251764, A251765, A251766.
%K A251761 nonn,easy
%O A251761 0,12
%A A251761 _Arie Bos_, Dec 07 2014