cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A343921 The maximum number of times a positive number can be added to n such that the digits in each resulting sum are distinct.

Original entry on oeis.org

36, 9, 12, 13, 12, 11, 15, 12, 11, 26, 14, 13, 23, 11, 11, 13, 26, 11, 12, 12, 13, 23, 14, 11, 24, 12, 13, 35, 25, 12, 12, 16, 13, 12, 12, 11, 13, 11, 17, 12, 13, 12, 15, 9, 12, 12, 25, 9, 14, 22, 12, 23, 12, 25, 34, 11, 11, 13, 22, 11, 16, 12, 14, 12, 12, 24, 13, 13, 15, 12, 13, 10, 11, 11, 9
Offset: 0

Views

Author

Scott R. Shannon, May 04 2021

Keywords

Comments

See A338659 for the smallest positive number that can be added to n a total of a(n) times such that the digits in each resulting sum are distinct.
See A343922 for the largest positive number that can be added to n a total of a(n) times such that the digits in each resulting sum are distinct.

Examples

			a(8) = 11 as A338659(8) = A343922(8) = 150 can be added to 8 a total of 11 times with each sum containing distinct digits. The sums are 158, 308, 458, 608, 758, 908, 1058, 1208, 1358, 1508, 1658. No other positive number can be added to 8 a total of 11 or more times to produce such sums.
		

Crossrefs

Formula

a(n) = 0 for n >= 9876543210.

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.

Original entry on oeis.org

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
Offset: 0

Views

Author

Scott R. Shannon, Apr 22 2021

Keywords

Examples

			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

Formula

a(n) = -1 for n >= 9876543210.
Showing 1-2 of 2 results.