login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A100373
Lexicographically earliest increasing sequence of composite numbers such that the digits of a(n) do not appear in a(n-1).
0
4, 6, 8, 9, 10, 22, 30, 42, 50, 62, 70, 81, 90, 111, 200, 314, 500, 611, 700, 812, 900, 1111, 2000, 3111, 4000, 5111, 6000, 7111, 8000, 9111, 20000, 31111, 40000, 51111, 60000, 71111, 80000, 91111, 200000, 311113, 400000, 511112, 600000, 711111
OFFSET
1,1
MATHEMATICA
ta={1}; Do[s1=IntegerDigits[Part[ta, Length[ta]]]; s2=IntegerDigits[n]; If[Equal[Intersection[s1, s2], {}] &&!PrimeQ[n], Print[{Last[ta], n}]; ta=Append[ta, n]], {n, 1, 1000000}]; ta=Delete[ta, 1]
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Labos Elemer, Dec 01 2004
STATUS
approved