proposed
approved
proposed
approved
editing
proposed
a(n) is the maximum number of distinct sets that can be obtained as complete parenthesizations of “S_1 union S_2 intersect S_3 union S_4 intersect S_5 union ... union S_{2*n}”, where n union and n-1 intersection operations alternate, starting with a union, and S_1, S_2, ... , S_{2*n} are sets. - Alexander Burstein, Nov 22 2023
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
From Peter Bala, May 07 2023: (Start)
n*(2*n-1)*(5*n-9)*a(n) = 2*(55*n^3-209*n^2+255*n-99)*a(n-1) + (n-3)*(2*n-3)*(5*n-4)*a(n-2) with a(1) = 1 and a(2) = 4.
G.f.: A(x) = series reversion of x*(1 - x)^2/(1 + x)^2. - _Peter Bala_, Apr 26 2023(End)
A(x) = series reversion of x*(1 - x)^2/(1 + x)^2. - Peter Bala, Apr 26 2023
nonn,easy
approved
editing
proposed
approved
editing
proposed