|
%I #8 Mar 24 2022 15:21:16
%S 0,0,1,1,1,3,5,6,10,19,30,45,74,124,199,317,515,839,1355,2186,3540,
%T 5735,9276,15001,24276,39288,63565,102841,166405,269259,435665,704910,
%U 1140574,1845499,2986074,4831557,7817630,12649204,20466835,33116021
%N a(n+4) = a(n+3)+a(n+1)+a(n)+k(n), where k(n) = 0, 1, 0, or -1 according to n mod 4.
%C a(n) + 2a(n+2) + a(n+4) is the (n+4)th Fibonacci number.
%H Harvey P. Dale, <a href="/A115059/b115059.txt">Table of n, a(n) for n = 0..1000</a>
%t nxt[{n_,a_,b_,c_,d_}]:={n+1,b,c,d,a+b+d+Which[Mod[n+1,4] == 0,0,Mod[ n+1,4] == 1,1,Mod[n+1,4]==2,0,True,-1]}; NestList[nxt,{3,0,0,1,1},40][[All,2]] (* _Harvey P. Dale_, Mar 24 2022 *)
%K nonn
%O 0,6
%A M. N. Deshpande (dpratap_ngp(AT)sancharnet.in), Feb 28 2006
%E Edited by _Don Reble_, Mar 14 2006
|
