login
A263485
Triangle read by rows: T(n,k) (n>=2, 1<=k<=n!) is the number of permutations pi of n such that there are k permutations >= pi in the (strong) Bruhat order.
0
1, 1, 1, 2, 0, 2, 0, 1, 1, 3, 0, 5, 0, 2, 0, 4, 0, 0, 0, 4, 0, 1, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 1, 4, 0, 9, 0, 3, 0, 12, 0, 0, 0, 10, 0, 2, 0, 8, 0, 4, 0, 2, 0, 0, 0, 14, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 4, 0, 0, 0, 2, 0, 2, 0, 4, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 1
OFFSET
2,4
COMMENTS
Row sums give A000142, n >= 2.
By symmetry, this is also the number of permutations of n the number of permutations pi of n such that there are k permutations <= pi in the (strong) Bruhat order.
EXAMPLE
Triangle begins:
1,1,
1,2,0,2,0,1,
1,3,0,5,0,2,0,4,0,0,0,4,0,1,0,0,0,2,0,1,0,0,0,1,
...
CROSSREFS
Cf. A000142.
Sequence in context: A046922 A193779 A279048 * A263489 A238660 A174793
KEYWORD
nonn,tabf
AUTHOR
Christian Stump, Oct 19 2015
STATUS
approved