

A343922


The largest 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.


2



27, 7012, 34, 81, 15, 781, 48, 86, 150, 37, 355, 23, 37, 47, 56, 15, 37, 931, 55, 355, 44, 37, 14, 17, 27, 340, 811, 27, 37, 340, 31, 37, 37, 15, 778, 61, 14, 91, 22, 48, 44, 233, 63, 299, 606, 75, 37, 9111, 75, 37, 14, 27, 7811, 37, 27, 91, 37, 63, 37, 171, 287, 391, 74, 43, 44, 37, 43, 480
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


LINKS

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


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) = 7012 as 7012 can be added to 1 a total of A343921(1) = 9 times with each sum containing distinct digits. The sums are 7013, 14025, 21037, 28049, 35061, 42073, 49085, 56097, 63109. There are fourteen positive numbers in all which can be added to 1 a total of 9 times producing sums with distinct digits, the smallest being 1 (see A338659).
a(47) = 9111 as 9111 can be added to 47 a total of A343921(47) = 9 times with each sum containing distinct digits. The sums are 9158, 18269, 27380, 36491, 45602, 54713, 63824, 72935, 82046. There are five positive numbers in all which can be added to 47 a total of 9 times producing sums with distinct digits, the smallest being 3 (see A338659).


CROSSREFS

Cf. A343921, A338659, A010784, A043096, A029743.
Sequence in context: A123395 A051680 A013828 * A209261 A001321 A263601
Adjacent sequences: A343919 A343920 A343921 * A343923 A343926 A343927


KEYWORD

nonn,base


AUTHOR

Scott R. Shannon, May 04 2021


STATUS

approved



