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 A251740 #21 Mar 28 2025 10:35:56
%S A251740 0,0,0,0,0,1,0,0,1,2,4,8,16,32,63,126,252,503,1004,2004,4000,7984,
%T A251740 15936,31809,63492,126732,252961,504918,1007832,2011664,4015344,
%U A251740 8014752,15997695,31931898,63737064,127221167,253937416,506867000,1011722336,2019429328
%N A251740 8-step Fibonacci sequence starting with 0,0,0,0,0,1,0,0.
%H A251740 G. C. Greubel, <a href="/A251740/b251740.txt">Table of n, a(n) for n = 0..1000</a>
%H A251740 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1)
%F A251740 a(n+8) = a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4)+a(n+5)+a(n+6)+a(n+7).
%F A251740 G.f.: x^5*(-1+x+x^2)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8) . - _R. J. Mathar_, Mar 28 2025
%F A251740 a(n) = A079262(n+2)-A079262(n+1)-A079262(n). - _R. J. Mathar_, Mar 28 2025
%t A251740 LinearRecurrence[Table[1, {8}], {0, 0, 0, 0, 0, 1, 0, 0}, 43] (* _Michael De Vlieger_, Dec 08 2014 *)
%Y A251740 Other 8-step Fibonacci sequences are A079262, A105754, A251672, A251741, A251742, A251744, A251745.
%K A251740 nonn,easy
%O A251740 0,10
%A A251740 _Arie Bos_, Dec 07 2014