|
|
A368881
|
|
a(n) = binomial(n+3, 4) + binomial(n+1, 3) + 1.
|
|
1
|
|
|
1, 2, 7, 20, 46, 91, 162, 267, 415, 616, 881, 1222, 1652, 2185, 2836, 3621, 4557, 5662, 6955, 8456, 10186, 12167, 14422, 16975, 19851, 23076, 26677, 30682, 35120, 40021, 45416, 51337, 57817, 64890, 72591, 80956, 90022, 99827, 110410, 121811, 134071
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The number of bigrassmannian permutations in the type B hyperoctahedral group of order 2^n*n!, i.e., those with a unique left and right type B descent or the identity. This can be characterized by avoiding 18 signed permutation patterns.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (1/24)*(n^4 + 10*n^3 + 11*n^2 + 2*n + 24).
G.f.: (x^4 - 5x^3 + 7x^2 - 3x + 1)/(1-x)^5.
E.g.f.: exp(x)*(24 + 24*x + 48*x^2 + 16*x^3 + x^4)/24. - Stefano Spezia, Jan 09 2024
|
|
EXAMPLE
|
For n=2, all eight 2 X 2 signed permutation matrices are bigrassmannian except the negative of the identity matrix, or equivalently the one with window notation [-1 -2], so a(2) = 7.
|
|
MATHEMATICA
|
Table[Binomial[n + 3, 4] + Binomial[n + 1, 3] + 1, {n, 0, 20}]
|
|
PROG
|
(Python)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|