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 A251750 #20 Mar 28 2025 10:53:40
%S A251750 0,0,0,1,0,0,0,0,0,1,2,4,8,15,30,60,120,240,480,959,1916,3828,7648,
%T A251750 15281,30532,61004,121888,243536,486592,972225,1942534,3881240,
%U A251750 7754832,15494383,30958234,61855464,123589040,246934544,493382496,985792767,1969643000
%N A251750 9-step Fibonacci sequence starting with 0,0,0,1,0,0,0,0,0.
%H A251750 Robert Price, <a href="/A251750/b251750.txt">Table of n, a(n) for n = 0..1000</a>
%H A251750 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1,1).
%F A251750 a(n+9) = a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4)+a(n+5)+a(n+6)+a(n+7)+a(n+8).
%F A251750 G.f.: x^3*(-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+x^9) . - _R. J. Mathar_, Mar 28 2025
%t A251750 LinearRecurrence[Table[1, {9}], {0, 0, 0, 1, 0, 0, 0, 0, 0}, 44] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251750 Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251746, A251747, A251748, A251749, A251751, A251752.
%Y A251750 Cf. A255533 (Indices of primes in this sequence).
%K A251750 nonn,easy
%O A251750 0,11
%A A251750 _Arie Bos_, Dec 07 2014