login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297626 Triangle read by rows in which row n gives a partition of n with the most subpartitions. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A partition and its conjugate have the same number of subpartitions; in the case of ties, we take the lexicographically earliest partition.
LINKS
EXAMPLE
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
Sequence in context: A070786 A255542 A117500 * A206441 A175245 A167413
KEYWORD
nonn,tabf
AUTHOR
Brian Hopkins, Jan 04 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)