A376664 Least number k such that there are A376663(n) partitions x_1 + ... + x_j = k such that the multinomial coefficient k!/(x_1! * ... * x_j!) is equal to n, i.e., the first row k of A036038 in which n appears A376663(n) times (or 0 if n = 0).

0, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 4, 13, 14, 6, 16, 17, 18, 19, 5, 7, 22, 23, 4, 25, 26, 27, 8, 29, 5, 31, 32, 33, 34, 7, 9, 37, 38, 39, 40, 41, 7, 43, 44, 10, 46, 47, 48, 49, 50, 51, 52, 53, 54, 11, 8, 57, 58, 59, 5, 61, 62, 63, 64, 65, 12, 67, 68, 69, 8, 71

Offset

1,2

Comments

Differs from A376368 at n = 1260, 2520, 5040, 60060, 83160, ... . For example, 1260 appears first in row A376368(1260) = 7 of A036038, but only once. It also appears once in row 9, but in row a(1260) = 10 it appears A376663(1260) = 2 times.

a(n) <= n, with equality if and only if n is not in A325472.

Links

Pontus von Brömssen, Table of n, a(n) for n = 1..10000

Pontus von Brömssen, Log-log plot, using Plot2.

Crossrefs

Cf. A036038, A325472, A376368, A376663.

Sequence in context: A309639 A327393 A376368 * A217434 A322035 A325943

Adjacent sequences: A376661 A376662 A376663 * A376665 A376666 A376667

Keyword

nonn

Author

Pontus von Brömssen, Oct 02 2024

Status

approved