|
|
A140713
|
|
Triangle read by rows: T(n,k) is the number of white corners of rank k in all the permutations of {1,2,...,n} (n>=2, 0<=k<=n-2; for definitions see the Eriksson-Linusson references).
|
|
1
|
|
|
1, 5, 1, 26, 9, 2, 154, 70, 26, 6, 1044, 562, 268, 102, 24, 8028, 4860, 2700, 1308, 504, 120, 69264, 45756, 28224, 15828, 7728, 3000, 720
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
T(n,n-2) = (n-2)!.
|
|
REFERENCES
|
K. Eriksson and S. Linusson. Combinatorics of Fulton's essential set. Duke Mathematical Journal 85(1):61-76, 1996.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle starts:
1;
5,1;
26,9,2;
154,70,26,6;
1044,562,268,102,24;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|