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.

A297626 Triangle read by rows in which row n gives a partition of n with the most subpartitions.

Original entry on oeis.org

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

Views

Author

Brian Hopkins, Jan 04 2018

Keywords

Comments

A partition and its conjugate have the same number of subpartitions; in the case of ties, we take the lexicographically earliest partition.

Examples

			Triangle begins
1
2
2 1
3 1
3 1 1
3 2 1
4 2 1
4 2 1 1
5 2 1 1
5 3 1 1
5 3 2 1
5 3 2 1 1
6 3 2 1 1
6 3 2 1 1 1
6 4 2 1 1 1
6 4 2 2 1 1
6 4 3 2 1 1
7 4 3 2 1 1
7 4 3 2 1 1 1
7 5 3 2 1 1 1
8 5 3 2 1 1 1
8 5 3 2 2 1 1
8 5 3 2 2 1 1 1
9 5 3 2 2 1 1 1
8 5 4 3 2 1 1 1
9 5 4 3 2 1 1 1
9 6 4 3 2 1 1 1
9 6 4 3 2 1 1 1 1
9 6 4 3 2 2 1 1 1
		

Crossrefs