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.

A033178 Number of multisets of n positive integers with equal sum and product.

Original entry on oeis.org

1, 1, 1, 3, 1, 2, 2, 2, 2, 3, 2, 4, 2, 2, 2, 4, 2, 4, 2, 4, 2, 4, 1, 5, 4, 3, 3, 5, 2, 4, 3, 5, 2, 3, 2, 6, 3, 3, 4, 7, 2, 5, 2, 4, 4, 5, 2, 5, 4, 4, 3, 7, 2, 5, 4, 5, 4, 4, 2, 9, 3, 4, 4, 7, 2, 5, 5, 4, 3, 6, 3, 9, 4, 3, 3, 6, 3, 5, 2, 7, 4, 5, 2, 10, 5, 4, 5, 8, 2, 6, 3, 6, 3, 6, 5, 6, 5, 4, 5, 8, 3, 6, 3, 5
Offset: 2

Views

Author

Keywords

Comments

The multiset {n^1, 2^1, 1^(n-2)} has n elements and sum = product = 2n. Hence a(n) >= 1.

Examples

			a(5) = 3: {2,2,2,1,1}, {3,3,1,1,1}, {5,2,1,1,1}.
a(7) = 2: {4,3,1,1,1,1,1}, {7,2,1,1,1,1,1}.
		

References

  • R. K. Guy, 'Unsolved Problems in Number Theory' (Section D24).

Crossrefs