login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080574 a(1)=1, a(n)=a(n-1)+1 if n is odd and already in the sequence, a(n)=a(n-1)+2 if n is even and already in the sequence, a(n)=a(n-1)+3 otherwise. 0
1, 4, 7, 9, 12, 15, 16, 19, 20, 23, 26, 28, 31, 34, 35, 37, 40, 43, 44, 46, 49, 52, 53, 56, 59, 61, 64, 66, 69, 72, 73, 76, 79, 81, 82, 85, 86, 89, 92, 94, 97, 100, 101, 103, 106, 108, 111, 114, 115, 118, 121, 123, 124, 127, 130, 132, 135, 138, 139, 142 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

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

It appears that a(n) is asymptotic to c*n where c=2.36... is the largest root of q^2-3*q+3/2 = 0.

CROSSREFS

Sequence in context: A186323 A007064 A086824 * A189367 A007066 A047537

Adjacent sequences:  A080571 A080572 A080573 * A080575 A080576 A080577

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Mar 23 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:43 EST 2012. Contains 205978 sequences.