A338659 - OEIS

A338659

The smallest positive number that can be added to n the maximum number of times, see A343921(n), such that the digits in each resulting sum are distinct, or -1 if no such number exists.

27, 1, 34, 81, 15, 81, 48, 86, 150, 37, 355, 23, 37, 47, 56, 15, 37, 44, 55, 37, 43, 37, 14, 17, 27, 340, 811, 27, 37, 340, 15, 37, 37, 15, 23, 35, 14, 91, 22, 48, 44, 233, 63, 33, 53, 75, 37, 3, 75, 37, 14, 27, 811, 37, 27, 88, 37, 63, 37, 171, 22, 391, 74, 43, 44, 37, 43, 480, 37, 37, 478

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

LINKS

Table of n, a(n) for n=0..70.

FORMULA

a(n) = -1 for n >= 9876543210.

EXAMPLE

a(0) = 27 as 27 can be added to 0 a total of A343921(0) = 36 times with each sum containing distinct digits. The 36 sums are 27, 54, 81, 108, 135, ..., 918, 945, 972. No other positive number can be added 36 or more times to 0 to produce such sums.

a(1) = 1 as 1 can be added to 1 a total of A343921(1) = 9 times with each sum containing distinct digits. The sums are 2,3,4,5,6,7,8,9,10. There are fourteen positive numbers in all which can be added to 1 a total of 9 times producing sums with distinct digits, the largest being 7012 (see A343922).

a(2) = 34 as 34 can be added to 2 a total of A343921(2) = 12 times with each sum containing distinct digits. The sums are 36, 70, 104, 138, 172, 206, 240, 274, 308, 342, 376, 410. No other positive number can be added 12 or more times to 2 to produce such sums.

CROSSREFS

Cf. A343921, A343922, A010784, A043096, A029743.

Sequence in context: A040754 A059952 A244110 * A040755 A261197 A132651

Adjacent sequences: A338656 A338657 A338658 * A338660 A338661 A338662

KEYWORD

nonn,base

AUTHOR

Scott R. Shannon, Apr 22 2021

STATUS

approved