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 A251711 #22 Mar 28 2025 10:32:56
%S A251711 0,0,0,0,1,0,0,1,2,4,8,16,31,62,124,247,492,980,1952,3888,7745,15428,
%T A251711 30732,61217,121942,242904,483856,963824,1919903,3824378,7618024,
%U A251711 15174831,30227720,60212536,119941216,238918608,475917313,948010248,1888402472,3761630113
%N A251711 7-step Fibonacci sequence starting with (0,0,0,0,1,0,0).
%H A251711 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1).
%F A251711 a(n+7) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5) + a(n+6).
%F A251711 G.f.: x^4*(-1+x+x^2)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7) . - _R. J. Mathar_, Mar 28 2025
%F A251711 a(n) = A066178(n-4)-A066178(n-5)-A066178(n-6). - _R. J. Mathar_, Mar 28 2025
%t A251711 LinearRecurrence[Table[1, {7}], {0, 0, 0, 0, 1, 0, 0}, 40] (* _Michael De Vlieger_, Dec 09 2014 *)
%o A251711 (J) NB. see A251713 for the program and apply it to 0 0 0 0 1 0 0.
%Y A251711 Other 7-step Fibonacci sequences are A066178, A104621, A122189, A251710, A251712, A251713, A251714.
%K A251711 nonn,easy
%O A251711 0,9
%A A251711 _Arie Bos_, Dec 07 2014