Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".
1,1
a(1)=3; for n>1, a(n+1)=a(n)+4 if n is already in the sequence, a(n+1)=a(n)+3 otherwise.
Vincenzo Librandi, Table of n, a(n) for n = 1..10000
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)
Index entries for sequences related to Beatty sequences
(MAGMA) [Floor(n*(3+Sqrt(13))/2): n in [1..80]]; // Vincenzo Librandi, Oct 25 2011
Differs from A059550 at 76th term.
Sequence in context: A059540 A190363 A059550 * A171982 A066343 A184909
Adjacent sequences: A080078 A080079 A080080 * A080082 A080083 A080084
nonn,easy
N. J. A. Sloane, Mar 15 2003
approved