OFFSET
0,1
LINKS
Harry J. Smith, Table of n, a(n) for n = 0..2000
MATHEMATICA
nmax = 100; XhasD[x_, d_] := MemberQ[IntegerDigits[x], d]; Reap[For[n = 0, n <= nmax, n++, For[m = n+1, m <= 10*n + 10, m++, a = m; b = False; For[d = 0, d <= 9, d++, If[XhasD[n, d] && XhasD[m, d], b = True; Break[]]]; If[b, Break[]]]; Sow[a]]][[2, 1]] (* Jean-François Alcover, Jul 31 2015, after Harry J. Smith *)
PROG
(PARI) XhasD(x, d)= { local(f); while (x>9, f=x-10*(x\10); if (f==d, return(1)); x\=10); return(x==d) } { for (n=0, 2000, for (m=n + 1, 10*n + 10, a=m; b=0; for (d=0, 9, if (XhasD(n, d) && XhasD(m, d), b=true; break)); if (b, break) ); write("b063660.txt", n, " ", a) ) } \\ Harry J. Smith, Aug 27 2009
(Haskell)
import Data.List (intersect)
a063660 n = head [m | m <- [n + 1 ..],
not $ null $ show m `intersect` show n]
-- Reinhard Zumkeller, Jan 15 2013
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Reinhard Zumkeller, Jul 25 2001
STATUS
approved