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.

A376821 Number of irreducible pairs of partitions of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 3, 3, 6, 7, 8, 4, 6, 7, 12, 17, 23, 23, 31, 38, 36, 70, 71, 101, 127, 118, 145, 191, 209, 261, 309, 396, 462, 512, 652, 769, 878, 1097, 1320, 1563, 1827, 2098, 2533, 2932, 3475, 4185, 4756, 5726, 6614, 7686, 9189, 10825
Offset: 0

Views

Author

Pontus von Brömssen, Oct 05 2024

Keywords

Comments

A pair of partitions of n is irreducible if the two partitions yield the same multinomial coefficient but have no parts in common. The partitions in the pair are required to be distinct, otherwise a(0) would be 1.

Examples

			   n | irreducible pairs of partitions of n
  ---+-------------------------------------
   7 | (1,1,1,4), (2,2,3)
   8 | (1,1,6), (3,5)
  10 | (1,4,5), (2,2,6)
  13 | (1,1,1,10), (6,7)
     | (1,1,3,8), (2,4,7)
     | (1,1,1,1,1,8), (2,2,2,7)
  14 | (1,2,2,9), (3,3,8)
     | (1,1,1,2,9), (3,4,7)
     | (1,1,1,1,1,1,4,4), (2,2,2,2,3,3)
		

Crossrefs