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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080731 a(1)=1; a(2)=6; for n > 2, a(n) is taken as the smallest positive integer greater than a(n-1) such that the condition "n is a member of the sequence if and only if a(n) is odd" is satisfied. 2
1, 6, 8, 10, 12, 13, 14, 15, 16, 17, 18, 19, 21, 23, 25, 27, 29, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Increases according to a pattern analogous to the one for A079000.

LINKS

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

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)

EXAMPLE

Because a(2)=6, a(6)=13 is the next odd member of the sequence after 1; terms a(3)-a(5) are the smallest even numbers greater than 6, in order.

CROSSREFS

Cf. A079000, A080752.

Sequence in context: A018221 A071278 A079772 * A080257 A050199 A268388

Adjacent sequences:  A080728 A080729 A080730 * A080732 A080733 A080734

KEYWORD

easy,nonn

AUTHOR

Matthew Vandermast, Mar 08 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 22:10 EDT 2019. Contains 327088 sequences. (Running on oeis4.)