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 A251742 #18 Mar 28 2025 10:42:48
%S A251742 0,0,0,1,0,0,0,0,1,2,4,8,15,30,60,120,240,479,956,1908,3808,7601,
%T A251742 15172,30284,60448,120656,240833,480710,959512,1915216,3822831,
%U A251742 7630490,15230696,30400944,60681232,121121631,241762552,482565592,963215968,1922609105
%N A251742 8-step Fibonacci sequence starting with 0,0,0,1,0,0,0,0.
%H A251742 G. C. Greubel, <a href="/A251742/b251742.txt">Table of n, a(n) for n = 0..1000</a>
%H A251742 <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 A251742 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 A251742 G.f.: x^3*(-1+x+x^2+x^3+x^4)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8) . - _R. J. Mathar_, Mar 28 2025
%F A251742 a(n) = A172318(n-3)-2*A172318(n-4)+A172318(n-8) . - _R. J. Mathar_, Mar 28 2025
%t A251742 LinearRecurrence[Table[1, {8}], {0, 0, 0, 1, 0, 0, 0, 0}, 43] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251742 Other 8-step Fibonacci sequences are A079262, A105754, A251672, A251740, A251741, A251744, A251745.
%K A251742 nonn,easy
%O A251742 0,10
%A A251742 _Arie Bos_, Dec 07 2014