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 A251747 #21 Mar 28 2025 10:51:24
%S A251747 0,0,0,0,0,0,1,0,0,1,2,4,8,16,32,64,127,254,508,1015,2028,4052,8096,
%T A251747 16176,32320,64576,129025,257796,515084,1029153,2056278,4108504,
%U A251747 8208912,16401648,32770976,65477376,130825727,261393658,522272232,1043515311,2084974344
%N A251747 9-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0,0.
%H A251747 Robert Price, <a href="/A251747/b251747.txt">Table of n, a(n) for n = 0..1000</a>
%H A251747 <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 A251747 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 A251747 G.f.: x^6*(-1+x+x^2)/(-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 A251747 a(n) = A104144(n+2)-A104144(n+1)-A104144(n). - _R. J. Mathar_, Mar 28 2025
%t A251747 LinearRecurrence[Table[1, {9}], {0, 0, 0, 0, 0, 0, 1, 0, 0}, 44] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251747 Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251746, A251748, A251749, A251750, A251751, A251752.
%Y A251747 Cf. A255531 (Indices of primes in this sequence).
%K A251747 nonn,easy
%O A251747 0,11
%A A251747 _Arie Bos_, Dec 07 2014