login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of solid partitions of n such that all parts occur with the same multiplicity.
0

%I #7 Dec 21 2024 11:17:33

%S 1,1,4,10,20,31,97,105,228,466,657,953,2958,2675,4884,11635,13485,

%T 19136,58099,48816,89138,219474,197247,296097,1026590,713425,1099311

%N Number of solid partitions of n such that all parts occur with the same multiplicity.

%H John Tyler Rascoe, <a href="/A379278/a379278.py.txt">Python program</a>.

%e 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 (Python) # see links

%Y Cf. A000041, A000219, A000293, A207542, A323657.

%K nonn,more,new

%O 0,3

%A _John Tyler Rascoe_, Dec 19 2024