|
Search: id:A125132
|
|
|
| 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)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Inspired by Angelini's sequence A114308.
|
|
EXAMPLE
|
Here are the digits strung together (the odd digits occur at positions that are indexed by terms of the sequence):
-135278911
1315171921
2325272931
3335373941
4345474951
5355575961
6365676971
7375777981
8385878991
9395979911
0101214281
113032...
Explanation: a(2)=2? No. a(2)=3? Yes, but then the third term has to be odd and 2 has to appear later. a(3)=2? No, a(3) must be odd, so 5. a(4)? Now we can fill in the 2 that has been waiting. And so on.
|
|
CROSSREFS
|
Cf. A125133 (missing numbers), A114308 (same except need a(n) > a(n-1)).
Sequence in context: A097465 A120683 A079313 this_sequence A026184 A026208 A120837
Adjacent sequences: A125129 A125130 A125131 this_sequence A125133 A125134 A125135
|
|
KEYWORD
|
base,easy,nonn,more
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2007
|
|
EXTENSIONS
|
This and A125133 were computed by hand and should be checked!
|
|
|
Search completed in 0.002 seconds
|
