Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125132
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125132 Self-describing sequence: sequence starts with a(1) = 1 and a(n) is chosen to be the smallest positive number not already in the sequence such that the assertion "sequence gives the positions of the odd digits when the sequence is read as a string of digits" is true. +0
3
1, 3, 5, 2, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 110, 10, 12, 14, 28, 111, 30, 32 (list; graph; listen)
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research