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 A251714 #19 Mar 28 2025 10:34:05
%S A251714 0,1,0,0,0,0,0,1,2,3,6,12,24,48,96,191,380,757,1508,3004,5984,11920,
%T A251714 23744,47297,94214,187671,373834,744664,1483344,2954768,5885792,
%U A251714 11724287,23354360,46521049,92668264,184591864,367700384,732446000,1459006208,2906288129
%N A251714 7-step Fibonacci sequence starting with (0,1,0,0,0,0,0).
%H A251714 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1).
%F A251714 a(n+7) = a(n) + a(n+1) + a(n+2) + a(n+3) + a(n+4) + a(n+5) + a(n+6).
%F A251714 G.f.: x*(-1+x+x^2+x^3+x^4+x^5)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7) . - _R. J. Mathar_, Mar 28 2025
%t A251714 LinearRecurrence[Table[1, {7}], {0, 1, 0, 0, 0, 0, 0}, 40] (* _Michael De Vlieger_, Dec 09 2014 *)
%o A251714 (J) NB. see A251713 for the program and apply it to 0 1 0 0 0 0 0.
%Y A251714 Other 7-step Fibonacci sequences are A066178, A104621, A122189, A251710, A251711, A251712, A251713.
%K A251714 nonn,easy
%O A251714 0,9
%A A251714 _Arie Bos_, Dec 07 2014