A376828 - OEIS

A376828

Smallest nonnegative integer k such that there exist n partitions of k which all yield the same multinomial coefficient and with no part appearing in more than one of the partitions.

0, 7, 31, 50

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

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..4.

EXAMPLE

a(2) = 7 is the smallest k such that A376821(k) > 0.

| | n partitions of a(n) with a common multinomial coefficient

n | a(n) | but no part appearing in more than one of the partitions

--+-------+-----------------------------------------------------------

1 | 0 | ()

2 | 7 | (1,1,1,4), (2,2,3)

3 | 31 | (1,1,4,4,4,7,10), (2,2,2,2,5,9,9), (3,3,3,6,8,8)

4 | 50 | (1,1,1,9,12,26), (2,2,8,11,27), (3,3,3,16,25), (5,6,15,24)

CROSSREFS

Cf. A376661, A376673, A376821.

Sequence in context: A172490 A349666 A298039 * A135659 A337754 A255414

Adjacent sequences: A376825 A376826 A376827 * A376829 A376830 A376831

KEYWORD

nonn,hard,more

AUTHOR

Pontus von Brömssen, Oct 05 2024

STATUS

approved