This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080600 a(n) = ceiling(n*(3 + sqrt(13))/2). 0
 0, 4, 7, 10, 14, 17, 20, 24, 27, 30, 34, 37, 40, 43, 47, 50, 53, 57, 60, 63, 67, 70, 73, 76, 80, 83, 86, 90, 93, 96, 100, 103, 106, 109, 113, 116, 119, 123, 126, 129, 133, 136, 139, 143, 146, 149, 152, 156, 159, 162, 166, 169, 172, 176, 179, 182, 185, 189 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS 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. 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) CROSSREFS Equals A080081 + 1 for n > 0. Cf. A080455-A080458, A080036, A080037. Sequence in context: A310688 A062389 A191402 * A198266 A067497 A123384 Adjacent sequences:  A080597 A080598 A080599 * A080601 A080602 A080603 KEYWORD nonn AUTHOR N. J. A. Sloane, Mar 23 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 15:08 EST 2019. Contains 329979 sequences. (Running on oeis4.)