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 A251744 #16 Mar 28 2025 10:48:05
%S A251744 0,0,1,0,0,0,0,0,1,2,4,7,14,28,56,112,224,447,892,1780,3553,7092,
%T A251744 14156,28256,56400,112576,224705,448518,895256,1786959,3566826,
%U A251744 7119496,14210736,28365072,56617568,113010431,225572344,450249432,898711905,1793856984
%N A251744 8-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0.
%H A251744 G. C. Greubel, <a href="/A251744/b251744.txt">Table of n, a(n) for n = 0..1000</a>
%H A251744 <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 A251744 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 A251744 G.f.: x^2*(-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) . - _R. J. Mathar_, Mar 28 2025
%t A251744 LinearRecurrence[Table[1, {8}], {0, 0, 1, 0, 0, 0, 0, 0}, 43] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251744 Other 8-step Fibonacci sequences are A079262, A105754, A251672, A251740, A251741, A251742, A251745.
%K A251744 nonn,easy
%O A251744 0,10
%A A251744 _Arie Bos_, Dec 07 2014