The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Essentially the same as A083490. - R. J. Mathar, Sep 24 2013 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 Cf. A030283, A229364, A005843. Sequence in context: A279254 A212495 A083490 * A083498 A172442 A061513 Adjacent sequences:  A229360 A229361 A229362 * A229364 A229365 A229366 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Sep 21 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 03:56 EST 2021. Contains 349345 sequences. (Running on oeis4.)