|
%I #17 Mar 13 2022 16:15:19
%S 1,10,11,12,14,16,18,21,41,61,81,100,101,102,104,106,108,110,111,112,
%T 114,116,118,120,121,122,124,126,128,140,141,142,144,146,148,160,161,
%U 162,164,166,168,180,181,182,184,186,188,201,210,211,212,214,216,218
%N Numbers where 1 is the only odd decimal digit.
%C This is a 10-automatic language. - _Charles R Greathouse IV_, Oct 05 2011
%H Robert Israel, <a href="/A098945/b098945.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>
%p A[1]:= {0,2,4,6,8}: B[1]:= {1}:
%p for i from 2 to 3 do
%p A[i]:= A[i-1] union map(t -> seq(x*10^(i-1)+t,x=[2,4,6,8]), A[i-1]);
%p B[i]:= B[i-1] union map(t -> seq(x*10^(i-1)+t,x=[2,4,6,8]), B[i-1]) union map(t -> 10^(i-1)+t, A[i-1] union B[i-1]);
%p od:
%p sort(convert(B[3],list)); # _Robert Israel_, May 07 2020
%t Select[Range[250],Max[Select[IntegerDigits[#],OddQ]]==1&] (* _Harvey P. Dale_, Mar 13 2022 *)
%o (Perl) for (0..1000) {
%o print "$_, " if (/^[012468]*1[012468]*$/)
%o } # _Charles R Greathouse IV_, Oct 05 2011
%K base,easy,nonn
%O 1,2
%A _Eric Angelini_, Oct 21 2004
|
