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 A385373 #8 Jul 02 2025 17:13:06 %S A385373 1,1,6,138,14049,6851919 %N A385373 Number of solid partitions with multiplicities (1, ..., n). %C A385373 A solid partition with d distinct parts (p_1^(k_1) > p_2^(k_2) > ... > p_d^(k_d)) has the multiset of multiplicities (k_1, k_2, ..., k_d). %C A385373 Alternatively, a(n) is the number of chains of plane partitions ordered by inclusion, comprised of n consecutive triangular numbers starting with 1. %H A385373 John Tyler Rascoe, <a href="/A385373/a385373_1.py.txt">Python program</a>. %F A385373 a(n) = A379277(A164894(n)) for n > 0. %e A385373 For n = 2 a solid partition having multiplicities (1,2) has two distinct parts (a,b^2) with a < b, and there are 6 ways to arrange these parts. %o A385373 (Python) # see Links %Y A385373 Cf. A000217, A000219, A000293, A164894, A379277. %K A385373 nonn,more %O A385373 0,3 %A A385373 _John Tyler Rascoe_, Jun 27 2025