login
A387996
One third the number of solid partitions of n with 3 parts.
1
2, 2, 5, 7, 10, 13, 18, 21, 27, 32, 38, 44, 52, 58, 67, 75, 84, 93, 104, 113, 125, 136, 148, 160, 174, 186, 201, 215, 230, 245, 262, 277, 295, 312, 330, 348, 368, 386, 407, 427, 448, 469, 492, 513, 537, 560, 584, 608, 634, 658, 685, 711, 738, 765, 794, 821, 851
OFFSET
3,1
FORMULA
G.f.: q^3 * (q^2 + 2)/((1-q) * (1-q^2) * (1-q^3)).
EXAMPLE
a(6) = 7 counts the 21 solid partitions of 6: 9 arrangements of the parts (3,2,1), 6 arrangements of (4,1,1), and 6 arrangements of (2,2,2).
PROG
(PARI)
A_q(N) = {Vec( q^3 * (q^2 + 2)/((1-q) * (1-q^2) * (1-q^3)) + O('q^(N+1)))}
CROSSREFS
3*a(n) is column k=3 of A380893.
Sequence in context: A308842 A241761 A278388 * A239737 A262883 A308908
KEYWORD
nonn,easy
AUTHOR
John Tyler Rascoe, Oct 13 2025
STATUS
approved