OFFSET
0,3
COMMENTS
a(n) is the number of ordered set partitions of an n-set into 3 sets such that the first set is not empty, the second set cannot have a single element, and the third set cannot have two elements.
LINKS
Index entries for linear recurrences with constant coefficients, signature (13,-72,222,-417,489,-350,140,-24).
FORMULA
a(n) = 3^n - 2^n - n*(2^(n-1)-1) - binomial(n,2)*(2^(n-2)-1) + 3*binomial(n,3) except at n=3.
EXAMPLE
The 31 set partitions for n=4 are the following:
{1,2,3,4}, { }, { } (1 of these);
{1,2,3}, { }, {4}; (4 of these);
{1,2}, {3,4}, { }; (6 of these);
{1}, {2,3,4}, { }; (4 of these);
{1}, {2,3}, {4}; (12 of these);
{1}, { }, {2,3,4}; (4 of these).
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Enrique Navarrete, Feb 22 2023
STATUS
approved