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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080714 a(n) is taken to be the (n-th)-smallest positive integer greater than a(n-1) that is consistent with the condition "n is a member of the sequence if and only if a(n) is odd.". 0
1, 6, 12, 20, 30, 41, 54, 70, 88, 108, 130, 153, 178, 206, 236, 268, 302, 338, 376, 415, 456, 500, 546, 594, 644, 696, 750, 806, 864, 923, 984, 1048, 1114, 1182, 1252, 1324, 1398, 1474, 1552, 1632, 1713, 1796, 1882, 1970, 2060, 2152, 2246, 2342, 2440, 2540 (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)

EXAMPLE

a(2) cannot be 2 because that would require the second term to be odd, a condition 2 does not satisfy. Since 2 is therefore not in the sequence, the second term must be even. The second-smallest even number greater than 2 is 6; therefore a(2) is 6.

CROSSREFS

Cf. A079000.

Sequence in context: A079760 A109895 A083209 * A116368 A007622 A180291

Adjacent sequences:  A080711 A080712 A080713 * A080715 A080716 A080717

KEYWORD

nonn

AUTHOR

Matthew Vandermast (ghodges14(AT)comcast.net), Mar 05 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 15 23:53 EST 2012. Contains 205860 sequences.