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 A251749 #20 Mar 28 2025 10:51:56
%S A251749 0,0,0,0,1,0,0,0,0,1,2,4,8,16,31,62,124,248,496,991,1980,3956,7904,
%T A251749 15792,31553,63044,125964,251680,502864,1004737,2007494,4011032,
%U A251749 8014160,16012528,31993503,63923962,127721960,255192240,509881616,1018758495,2035509496
%N A251749 9-step Fibonacci sequence starting with 0,0,0,0,1,0,0,0,0.
%H A251749 Robert Price, <a href="/A251749/b251749.txt">Table of n, a(n) for n = 0..1000</a>
%H A251749 <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 A251749 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 A251749 G.f.: x^4*(-1+x+x^2+x^3+x^4)/(-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 A251749 LinearRecurrence[Table[1, {9}], {0, 0, 0, 0, 1, 0, 0, 0, 0}, 44] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251749 Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251746, A251747, A251748, A251750, A251751, A251752.
%Y A251749 Cf. A255532 (Indices of primes in this sequence).
%K A251749 nonn,easy
%O A251749 0,11
%A A251749 _Arie Bos_, Dec 07 2014