|
%I #15 Dec 19 2017 02:21:39
%S 0,0,0,1,0,0,0,0,1,2,4,8,15,30,60,120,240,479,956,1908,3808,7601,
%T 15172,30284,60448,120656,240833,480710,959512,1915216,3822831,
%U 7630490,15230696,30400944,60681232,121121631,241762552,482565592,963215968,1922609105
%N 8-step Fibonacci sequence starting with 0,0,0,1,0,0,0,0.
%H G. C. Greubel, <a href="/A251742/b251742.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1,1,1,1,1,1)
%F a(n+8) = a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4)+a(n+5)+a(n+6)+a(n+7).
%t LinearRecurrence[Table[1, {8}], {0, 0, 0, 1, 0, 0, 0, 0}, 43] (* _Michael De Vlieger_, Dec 09 2014 *)
%Y Other 8-step Fibonacci sequences are A079262, A105754, A251672, A251740, A251741, A251744, A251745.
%K nonn,easy
%O 0,10
%A _Arie Bos_, Dec 07 2014
|
