%I A125132
%S A125132 1,3,5,2,7,8,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,
%T A125132 45,47,49,51,53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,
%U A125132 89,91,93,95,97,99,110,10,12,14,28,111,30,32
%N 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.
%C A125132 Inspired by Angelini's sequence A114308.
%e A125132 Here are the digits strung together (the odd digits occur at positions 
               that are indexed by terms of the sequence):
%e A125132 -135278911
%e A125132 1315171921
%e A125132 2325272931
%e A125132 3335373941
%e A125132 4345474951
%e A125132 5355575961
%e A125132 6365676971
%e A125132 7375777981
%e A125132 8385878991
%e A125132 9395979911
%e A125132 0101214281
%e A125132 113032...
%e A125132 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.
%Y A125132 Cf. A125133 (missing numbers), A114308 (same except need a(n) > a(n-1)).
%Y A125132 Sequence in context: A097465 A120683 A079313 this_sequence A026184 A026208 
               A120837
%Y A125132 Adjacent sequences: A125129 A125130 A125131 this_sequence A125133 A125134 
               A125135
%K A125132 base,easy,nonn,more
%O A125132 1,2
%A A125132 N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2007
%E A125132 This and A125133 were computed by hand and should be checked!