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 A251712 #21 Mar 28 2025 10:33:13
%S A251712 0,0,0,1,0,0,0,1,2,4,8,15,30,60,120,239,476,948,1888,3761,7492,14924,
%T A251712 29728,59217,117958,234968,468048,932335,1857178,3699432,7369136,
%U A251712 14679055,29240152,58245336,116022624,231112913,460368648,917037864,1826706592,3638734129
%N A251712 7-step Fibonacci sequence starting with (0,0,0,1,0,0,0).
%H A251712 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1).
%F A251712 a(n+7) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5) + a(n+6).
%F A251712 G.f.: x^3*(-1+x+x^2+x^3)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7) . - _R. J. Mathar_, Mar 28 2025
%t A251712 LinearRecurrence[Table[1, {7}], {0, 0, 0, 1, 0, 0, 0}, 40] (* _Michael De Vlieger_, Dec 09 2014 *)
%o A251712 (J) NB. see A251713 for the program and apply it to 0 0 0 1 0 0 0.
%Y A251712 Other 7-step Fibonacci sequences are A066178, A104621, A122189, A251710, A251711, A251713, A251714.
%K A251712 nonn,easy
%O A251712 0,9
%A A251712 _Arie Bos_, Dec 07 2014