Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080753
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080753 a(1)=2; for n > 1, a is the second-smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) is odd" is satisfied. +0
3
2, 5, 8, 12, 15, 18, 22, 25, 28, 32, 36, 39, 42, 46, 49, 52, 56, 59, 62, 66, 70, 73, 76, 80, 83, 86, 90, 93, 96, 100, 104, 107, 110, 114, 118, 121, 124, 128, 131, 134, 138, 141, 144, 148, 152, 155, 158, 162, 165, 168, 172, 175, 178, 182, 186, 189, 192, 196, 199, 202 (list; graph; listen)
OFFSET

1,1

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

Cf. A079000.

Sequence in context: A073837 A092767 A108311 this_sequence A087347 A062468 A061717

Adjacent sequences: A080750 A080751 A080752 this_sequence A080754 A080755 A080756

KEYWORD

easy,nonn

AUTHOR

Matthew Vandermast (ghodges14(AT)comcast.net), Mar 08 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research