OFFSET
0,5
COMMENTS
a(n) is the number of ordered set partitions of an n-set into 3 sets such that the first and second sets have an odd number of elements, and two elements are selected from the third.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (9,-24,0,78,-54,-80,72,27,-27).
FORMULA
a(n) = binomial(n,2)*(3^(n-2) + (-1)^n - 2)/4.
G.f.: 4*x^4*(3 - 12*x + 12*x^2 + 5*x^4)/((1 - x)^3*(1 + x)^3*(1 - 3*x)^3). - Andrew Howroyd, Nov 13 2025
EXAMPLE
For n = 6, we have the following cases:
{1}, {2}, {(3), (4), 5, 6} (90 of these),
{2}, {1}, {(3), (4), 5, 6} (90 of these),
{1, 2, 3}, {4}, {(5), (6)} (60 of these),
{1}, {2, 3, 4}, {(5), (6)} (60 of these),
where the two elements selected from the third set are in parentheses.
MATHEMATICA
A373134[n_] := n*(n-1)*(3^(n-2) + (-1)^n - 2)/8; Array[A373134, 30, 0] (* Paolo Xausa, Jan 19 2026 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Enrique Navarrete, May 26 2024
STATUS
approved
