A063661 - OEIS

%I #22 Apr 11 2022 12:13:50

%S 10,9,10,10,10,10,10,10,10,10,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,3,

%T 1,1,1,1,1,1,1,1,1,4,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,1,1,1,1,6,1,1,1,1,

%U 1,1,1,1,1,7,1,1,1,1,1,1,1,1,1,8,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1

%N a(n) = A063660(n) - n.

%H Harry J. Smith, <a href="/A063661/b063661.txt">Table of n, a(n) for n = 0..2000</a>

%F If n < 10, then a(n) = 10 - [n=1], if n >= 10 consists of a digit k (not equal to 8) followed by 9's, then a(n) = k+1, otherwise a(n) = 1. - _Charlie Neder_, May 23 2019

%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-n]]][[2, 1]] (* _Jean-François Alcover_, Nov 23 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("b063661.txt", n, " ", a - n) ) } \\ _Harry J. Smith_, Aug 27 2009

%Y Cf. A063660.

%K easy,nice,nonn,base,look

%O 0,1

%A _Reinhard Zumkeller_, Jul 25 2001