|
%I #6 Aug 28 2016 18:23:42
%S 1,2,4,6,10,16,22,32,42,58,80,102,134,176,218,276,334,414,516,618,752,
%T 886,1062,1280,1498,1774,2108,2442,2856,3270,3786,4404,5022,5774,6660,
%U 7546,8608,9670,10950,12448,13946,15720,17494,19602,22044,24486,27342
%N a(0)=1; thereafter a(n)=a(n-1)+a([n/Phi]), where Phi=(1+sqrt(5))/2, the golden ratio.
%C Same recursion as A006336, but different initial condition.
%H T. D. Noe, <a href="/A131882/b131882.txt">Table of n, a(n) for n = 0..1000</a>
%t a[0]=1; a[n_] := a[n] = a[n-1] + a[Floor[n/GoldenRatio]]; Table[a[n], {n,0,100}]
%K nonn
%O 0,2
%A _T. D. Noe_, Jul 23 2007
|
