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.
%I A297626 #17 Jan 28 2018 13:54:37 %S A297626 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, %T A297626 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, %U A297626 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 %N A297626 Triangle read by rows in which row n gives a partition of n with the most subpartitions. %C A297626 A partition and its conjugate have the same number of subpartitions; in the case of ties, we take the lexicographically earliest partition. %H A297626 Mathoverflow, <a href="https://mathoverflow.net/questions/281313/upper-bound-for-number-of-subpartitions-of-a-partition/">Upper bound for number of subpartitions of a partition</a>, posted Sep 16 2017 %e A297626 Triangle begins %e A297626 1 %e A297626 2 %e A297626 2 1 %e A297626 3 1 %e A297626 3 1 1 %e A297626 3 2 1 %e A297626 4 2 1 %e A297626 4 2 1 1 %e A297626 5 2 1 1 %e A297626 5 3 1 1 %e A297626 5 3 2 1 %e A297626 5 3 2 1 1 %e A297626 6 3 2 1 1 %e A297626 6 3 2 1 1 1 %e A297626 6 4 2 1 1 1 %e A297626 6 4 2 2 1 1 %e A297626 6 4 3 2 1 1 %e A297626 7 4 3 2 1 1 %e A297626 7 4 3 2 1 1 1 %e A297626 7 5 3 2 1 1 1 %e A297626 8 5 3 2 1 1 1 %e A297626 8 5 3 2 2 1 1 %e A297626 8 5 3 2 2 1 1 1 %e A297626 9 5 3 2 2 1 1 1 %e A297626 8 5 4 3 2 1 1 1 %e A297626 9 5 4 3 2 1 1 1 %e A297626 9 6 4 3 2 1 1 1 %e A297626 9 6 4 3 2 1 1 1 1 %e A297626 9 6 4 3 2 2 1 1 1 %Y A297626 Cf. A116480, A117500. %K A297626 nonn,tabf %O A297626 1,2 %A A297626 _Brian Hopkins_, Jan 04 2018