|
%I #10 Mar 04 2013 17:45:48
%S 1,4,6,7,8,9,11,12,13,16,21,22,24,31,41,42,44,46,50,60,62,64,66,71,81,
%T 83,84,85,86,88,200,201,210,301,400,410,420,422,423,431,510,520,600,
%U 602,604,606,608,620,622,624,626,628,640,642,644,646,648,660
%N Self-describing sequence: sequence starts with a(1) = 1 and a(n) is chosen to be the smallest number > a(n-1) such that the assertion "sequence gives the positions of the odd digits when the sequence is read as a string of digits" is true.
%H N. J. A. Sloane, <a href="/A114308/b114308.txt">Table of n, a(n) for n = 1..480</a>
%e Brackets indicate the odd digits in the sequence:
%e Sequence: (1),4,6,(7),8,(9),(1)(1),(1)2, (1)(3),(1)6
%e Positions of odd digits: 1st 4th 6th 7th 8th 9th 11th 12th 13th ..., which is the sequence itself.
%Y Cf. A125132.
%K base,easy,nonn
%O 1,2
%A _Eric Angelini_, Feb 05 2006
%E More terms from _N. J. A. Sloane_, Jan 10 2007
|
