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 A251745 #16 Mar 28 2025 10:48:26
%S A251745 0,1,0,0,0,0,0,0,1,2,3,6,12,24,48,96,192,383,764,1525,3044,6076,12128,
%T A251745 24208,48320,96448,192513,384262,766999,1530954,3055832,6099536,
%U A251745 12174864,24301408,48506368,96820223,193256184,385745369,769959784,1536863736,3067627936
%N A251745 8-step Fibonacci sequence starting with 0,1,0,0,0,0,0,0.
%H A251745 G. C. Greubel, <a href="/A251745/b251745.txt">Table of n, a(n) for n = 0..1000</a>
%H A251745 <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 A251745 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 A251745 G.f.: x*(-1+x+x^2+x^3+x^4+x^5+x^6)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8) . - _R. J. Mathar_, Mar 28 2025
%t A251745 LinearRecurrence[Table[1, {8}], {0, 1, 0, 0, 0, 0, 0, 0}, 43] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251745 Other 8-step Fibonacci sequences are A079262, A105754, A251672, A251740, A251741, A251742, A251744.
%K A251745 nonn,easy
%O A251745 0,10
%A A251745 _Arie Bos_, Dec 07 2014