|
|
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).
|
|
3
|
|
|
0, 2, 4, 6, 8, 10, 22, 30, 42, 50, 62, 70, 82, 90, 112, 300, 412, 500, 612, 700, 812, 900, 1112, 3000, 4112, 5000, 6112, 7000, 8112, 9000, 11112, 30000, 41112, 50000, 61112, 70000, 81112, 90000, 111112, 300000, 411112, 500000, 611112, 700000, 811112, 900000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
PROG
|
(Haskell)
import Data.List (intersect)
a229363 n = a229363_list !! (n-1)
a229363_list = f "" [0, 2 ..] where
f xs (e:es) = if null $ intersect xs ys then e : f ys es else f xs es
where ys = show e
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|