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 A379277 #13 Dec 21 2024 11:17:52 %S A379277 1,3,3,6,9,6,9,13,21,24,33,13,21,24,33,24,48,57,84,51,93,90,135,24,48, %T A379277 57,84,51,93,90,135,48,102,144,213,138,258,252,387,111,228,282,426, %U A379277 219,417,408,633,48,102,144,213,138,258,252,387,111,228,282,426,219 %N A379277 Number of solid partitions with multiplicities of parts matching the n-th composition in standard order. %H A379277 John Tyler Rascoe, <a href="/A379277/b379277.txt">Table of n, a(n) for n = 1..1024</a> %H A379277 John Tyler Rascoe, <a href="/A379277/a379277.py.txt">Python program</a>. %F A379277 a(2^k) = A000219(k+1). %F A379277 a(2^k-1) = A207542(k) for k > 0. %e A379277 The 5th composition in standard order, (2,1) corresponds to a solid partition with 3 parts (a,b,c) with a = b and a > c. There are 9 ways to arrange these parts into valid a solid partition giving a(5) = 9. %o A379277 (Python) # see links %Y A379277 Cf. A000041, A000219, A000293, A066099, A207542. %K A379277 nonn %O A379277 1,2 %A A379277 _John Tyler Rascoe_, Dec 19 2024