Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #15 Jun 25 2018 22:56:59
%S 10,10,12,13,14,15,16,17,18,19,11,12,13,14,15,16,17,18,19,21,21,22,23,
%T 24,25,26,27,28,29,32,31,32,33,34,35,36,37,38,39,43,41,42,43,44,45,46,
%U 47,48,49,54,51,52,53,54,55,56,57,58,59,65,61,62,63,64,65,66,67,68,69
%N Min{ m | m > n and both numbers have at least one common decimal digit}.
%H Harry J. Smith, <a href="/A063660/b063660.txt">Table of n, a(n) for n = 0..2000</a>
%t 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_ *)
%o (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
%o (Haskell)
%o import Data.List (intersect)
%o a063660 n = head [m | m <- [n + 1 ..],
%o not $ null $ show m `intersect` show n]
%o -- _Reinhard Zumkeller_, Jan 15 2013
%Y Cf. A063661, A063662.
%K easy,nonn,base
%O 0,1
%A _Reinhard Zumkeller_, Jul 25 2001