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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080633 a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 1 (mod 4)". 0
3, 4, 5, 9, 13, 14, 15, 16, 17, 18, 19, 20, 21, 25, 29, 33, 37, 41, 45, 49, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 89, 93, 97, 101, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Equivalently: unique monotonic sequence satisfying a(1)=3, a(a(n))=4n+1.

LINKS

Table of n, a(n) for n=1..67.

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 of the a(a(n)) = 2n family

FORMULA

There is an explicit formula for a(n) similar to that for A079000.

CROSSREFS

Sequence in context: A240056 A235396 A237132 * A026488 A242800 A136259

Adjacent sequences:  A080630 A080631 A080632 * A080634 A080635 A080636

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Feb 23 2003

EXTENSIONS

More terms from Matthew Vandermast, Mar 13 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 24 03:49 EST 2018. Contains 299595 sequences. (Running on oeis4.)