cp's OEIS Frontend

A251751 9-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0,0.

%I A251751 #22 Mar 28 2025 10:59:24
%S A251751 0,0,1,0,0,0,0,0,0,1,2,4,7,14,28,56,112,224,448,895,1788,3572,7137,
%T A251751 14260,28492,56928,113744,227264,454080,907265,1812742,3621912,
%U A251751 7236687,14459114,28889736,57722544,115331344,230435424,460416768,919926271,1838039800
%N A251751 9-step Fibonacci sequence starting with 0,0,1,0,0,0,0,0,0.
%H A251751 Robert Price, <a href="/A251751/b251751.txt">Table of n, a(n) for n = 0..1000</a>
%H A251751 <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 A251751 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 A251751 G.f.: x^2*(-1+x+x^2+x^3+x^4+x^5+x^6)/(-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 A251751 a(n) = A172319(n-2)-2*A172319(n-3)+A172319(n-9). - _R. J. Mathar_, Mar 28 2025
%t A251751 LinearRecurrence[Table[1, {9}], {0, 0, 1, 0, 0, 0, 0, 0, 0}, 44] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y A251751 Other 9-step Fibonacci sequences are A104144, A105755, A127193, A251746, A251747, A251748, A251749, A251750, A251752.
%Y A251751 Cf. A255534 (Indices of primes in this sequence).
%K A251751 nonn,easy
%O A251751 0,11
%A A251751 _Arie Bos_, Dec 07 2014