%I
%S 1,3,5,7,9,11,23,41,53,61,73,81,93,101,223,401,523,601,723,801,923,
%T 1001,2223,4001,5223,6001,7223,8001,9223,10001,22223,40001,52223,
%U 60001,72223,80001,92223,100001,222223,400001,522223,600001,722223,800001,922223
%N a(1) = 1; for n > 1: a(n) = smallest odd number greater than a(n1) which does not use any digit used by a(n1).
%o (Haskell)
%o import Data.List (intersect)
%o a229364 n = a229364_list !! (n1)
%o a229364_list = f "" [1, 3 ..] where
%o f xs (o:os) = if null $ intersect xs ys then o : f ys os else f xs os
%o where ys = show o
%Y Cf. A030284, A030283, A229363, A005408.
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, Sep 21 2013
