Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Dec 04 2024 08:47:21
%S 1,3,7,12,19,28,38,50,63,78,95,113,133,155,178,203,229,257,287,318,
%T 351,385,421,459,498,539,582,626,672,719,768,819,871,925,981,1038,
%U 1097,1157,1219,1283,1348,1415,1483,1553,1625,1698,1773,1850,1928,2008,2089
%N a(n) = a(n-1) + 1 + floor(n*golden ratio), with a(0) = 1.
%C This is column 1 of the rank array, A283734, of the golden ratio.
%H Clark Kimberling, <a href="/A283733/b283733.txt">Table of n, a(n) for n = 0..10000</a>
%F a(n) = A054347(n) + n + 1. - _Alan Michael Gómez Calderón_, Dec 03 2024
%t a[0] = 1; a[n_] := a[n] = a[n - 1] + 1 + Floor[n*GoldenRatio]; Table[a[n], {n, 0, 100}]
%o (PARI) g = (1 + sqrt(5))/2;
%o a(n) = if(n<1, 1, a(n - 1) + 1 + floor(n*g));
%o for(n=0, 100, print1(a(n),", ")) \\ _Indranil Ghosh_, Mar 17 2017
%Y Cf. A000201, A001622, A026351 (first differences), A054347, A283734.
%K nonn,easy
%O 0,2
%A _Clark Kimberling_, Mar 16 2017