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 A251752 #22 Mar 28 2025 11:04:02
%S A251752 0,1,0,0,0,0,0,0,0,1,2,3,6,12,24,48,96,192,384,767,1532,3061,6116,
%T A251752 12220,24416,48784,97472,194752,389120,777473,1553414,3103767,6201418,
%U A251752 12390616,24756816,49464848,98832224,197469696,394550272,788323071,1575092728
%N A251752 9-step Fibonacci sequence starting with 0,1,0,0,0,0,0,0,0.
%H A251752 Robert Price, <a href="/A251752/b251752.txt">Table of n, a(n) for n = 0..1000</a>
%H A251752 <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 A251752 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 A251752 G.f.: x*(-1+x+x^2+x^3+x^4+x^5+x^6+x^7)/(-1+x+x^2+x^3+x^4+x^5+x^6+x^7+x^8+x^9) . - _R. J. Mathar_, Mar 28 2025
%F A251752 a(n) = A172319(n-1)-2*A172319(n-2)+A172319(n-9). - _R. J. Mathar_, Mar 28 2025
%t A251752 LinearRecurrence[Table[1, {9}], {0, 1, 0, 0, 0, 0, 0, 0, 0}, 44] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251752 Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251746, A251747, A251748, A251749, A251750, A251751.
%Y A251752 Cf. A255536 (Indices of primes in this sequence).
%K A251752 nonn,easy
%O A251752 0,11
%A A251752 _Arie Bos_, Dec 07 2014