|
%I #13 Oct 30 2021 19:06:04
%S 0,4,7,10,14,17,20,24,27,30,34,37,40,43,47,50,53,57,60,63,67,70,73,76,
%T 80,83,86,90,93,96,100,103,106,109,113,116,119,123,126,129,133,136,
%U 139,143,146,149,152,156,159,162,166,169,172,176,179,182,185,189
%N a(n) = ceiling(n*(3 + sqrt(13))/2).
%C a(0)=0, a(1)=4; for n > 1, a(n) = a(n-1) + 4 if n is already in the sequence, a(n) = a(n-1) + 3 otherwise.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Cloitre/cloitre2.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> (math.NT/0305308)
%t With[{c=(3+Sqrt[13])/2},Table[Ceiling[c*n],{n,0,60}]] (* _Harvey P. Dale_, Oct 30 2021 *)
%Y Equals A080081 + 1 for n > 0. Cf. A080455-A080458, A080036, A080037.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Mar 23 2003
|
