141471

Appears in sequences

• Number of ways to partition the Young diagram of an integer partition of n into vertical sections.at n=9A321737
• Expansion of g.f. A(x) satisfying 0 = Sum_{k=0..n} (-1)^k * binomial(4*n-3*k, k) * ([x^k] A(x)^n) for n >= 1.at n=5A375442