|
%I #6 Sep 25 2013 03:50:20
%S 0,2,4,6,8,10,22,30,42,50,62,70,82,90,112,300,412,500,612,700,812,900,
%T 1112,3000,4112,5000,6112,7000,8112,9000,11112,30000,41112,50000,
%U 61112,70000,81112,90000,111112,300000,411112,500000,611112,700000,811112,900000
%N a(1) = 0; for n > 1: a(n) = smallest even number greater than a(n-1) which does not use any digit used by a(n-1).
%C Essentially the same as A083490. - _R. J. Mathar_, Sep 24 2013
%o (Haskell)
%o import Data.List (intersect)
%o a229363 n = a229363_list !! (n-1)
%o a229363_list = f "" [0, 2 ..] where
%o f xs (e:es) = if null $ intersect xs ys then e : f ys es else f xs es
%o where ys = show e
%Y Cf. A030283, A229364, A005843.
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, Sep 21 2013
|
