cp's OEIS Frontend

A229363 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).

%I A229363 #8 Oct 22 2024 10:01:10
%S A229363 0,2,4,6,8,10,22,30,42,50,62,70,82,90,112,300,412,500,612,700,812,900,
%T A229363 1112,3000,4112,5000,6112,7000,8112,9000,11112,30000,41112,50000,
%U A229363 61112,70000,81112,90000,111112,300000,411112,500000,611112,700000,811112,900000
%N A229363 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 A229363 Essentially the same as A083490. - _R. J. Mathar_, Sep 24 2013
%H A229363 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0, 1, 0, 0, 0, 0, 0, 10, 0, -10).
%o A229363 (Haskell)
%o A229363 import Data.List (intersect)
%o A229363 a229363 n = a229363_list !! (n-1)
%o A229363 a229363_list = f "" [0, 2 ..] where
%o A229363    f xs (e:es) = if null $ intersect xs ys then e : f ys es else f xs es
%o A229363                  where ys = show e
%Y A229363 Cf. A030283, A229364, A005843.
%K A229363 nonn,base
%O A229363 1,2
%A A229363 _Reinhard Zumkeller_, Sep 21 2013