A063661 a(n) = A063660(n) - n.

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, 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, 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

Offset

0,1

Links

Harry J. Smith, Table of n, a(n) for n = 0..2000

Formula

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

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-n]]][[2, 1]] (* Jean-François Alcover, Nov 23 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("b063661.txt", n, " ", a - n) ) } \\ Harry J. Smith, Aug 27 2009

Crossrefs

Cf. A063660.

Sequence in context: A216557 A070641 A231471 * A154533 A167608 A063596

Adjacent sequences: A063658 A063659 A063660 * A063662 A063663 A063664

Keyword

easy,nice,nonn,base,look

Author

Reinhard Zumkeller, Jul 25 2001

Status

approved