This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A343922 #16 May 07 2021 00:48:17 %S A343922 27,7012,34,81,15,781,48,86,150,37,355,23,37,47,56,15,37,931,55,355, %T A343922 44,37,14,17,27,340,811,27,37,340,31,37,37,15,778,61,14,91,22,48,44, %U A343922 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 %N 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. %F A343922 a(n) = -1 for n >= 9876543210. %e A343922 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. %e A343922 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). %e A343922 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). %Y A343922 Cf. A343921, A338659, A010784, A043096, A029743. %K A343922 nonn,base %O A343922 0,1 %A A343922 _Scott R. Shannon_, May 04 2021