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 A379278 #10 Apr 24 2025 16:44:08 %S A379278 1,1,4,10,20,31,97,105,228,466,657,953,2958,2675,4884,11635,13485, %T A379278 19136,58099,48816,89138,219474,197247,296097,1026590,713425,1099311, %U A379278 3386891,2744274,3788578,15225795,8562311,13588731,47251379,28547765,43887961,200572890,90616026 %N A379278 Number of solid partitions of n such that all parts occur with the same multiplicity. %H A379278 John Tyler Rascoe, <a href="/A379278/a379278.py.txt">Python program</a>. %e A379278 For a(3) = 10 there are 6 arrangements of parts (1,1,1), 3 arrangements of parts (2,1), and 1 arrangement of (3). %o A379278 (Python) # see links %Y A379278 Cf. A000041, A000219, A000293, A207542, A323657. %K A379278 nonn %O A379278 0,3 %A A379278 _John Tyler Rascoe_, Dec 19 2024 %E A379278 a(27)-a(37) from _Bert Dobbelaere_, Apr 24 2025