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 A251748 #25 Mar 28 2025 10:51:45
%S A251748 0,0,0,0,0,1,0,0,0,1,2,4,8,16,32,63,126,252,504,1007,2012,4020,8032,
%T A251748 16048,32064,64065,128004,255756,511008,1021009,2040006,4075992,
%U A251748 8143952,16271856,32511648,64959231,129790458,259325160,518139312,1035257615,2068475224
%N A251748 9-step Fibonacci sequence starting with 0,0,0,0,0,1,0,0,0.
%C A251748 The only primes in this sequence whose indices are less than 2*10^5 are 2 and 65865769729, which correspond to indices of 10 and 45. - _Robert Price_, Feb 24 2015
%H A251748 Robert Price, <a href="/A251748/b251748.txt">Table of n, a(n) for n = 0..1000</a>
%H A251748 <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 A251748 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 A251748 G.f.: x^5*(-1+x+x^2+x^3)/(-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 A251748 LinearRecurrence[Table[1, {9}], {0, 0, 0, 0, 0, 1, 0, 0, 0}, 44] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251748 Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251746, A251747, A251749, A251750, A251751, A251752.
%K A251748 nonn,easy
%O A251748 0,11
%A A251748 _Arie Bos_, Dec 07 2014