login

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”).

A080353
a(1)=5; for n>1, a(n)=a(n-1)+1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
1
5, 7, 9, 11, 12, 14, 15, 17, 18, 20, 21, 22, 24, 25, 26, 28, 29, 30, 32, 33, 34, 35, 37, 38, 39, 40, 42, 43, 44, 45, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 84, 86, 87, 88, 89
OFFSET
1,1
LINKS
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
FORMULA
a(n) = n + floor(sqrt(6*n)) + O(1).
MATHEMATICA
a[1] = 5; a[n_] := a[n] = If[MemberQ[Array[a, n-1], n], a[n-1]+1, a[n-1]+2]; Array[a, 67] (* Jean-François Alcover, Oct 08 2018 *)
CROSSREFS
Cf. A080036, A080037. Differences give A080354.
Sequence in context: A241853 A165513 A002342 * A184108 A254760 A279289
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 20 2003
STATUS
approved