A140714 Triangle read by rows: T(n,k) is the number of white corners of rank k in all 321-avoiding permutations of {1,2,...,n} (n>=2, 0<=k<=n-2; for definitions see the Eriksson-Linusson references).
1, 3, 1, 9, 5, 2, 28, 19, 12, 5, 90, 68, 51, 33, 14, 297, 240, 197, 150, 98, 42, 1001, 847, 735, 609, 466, 306, 132
Offset: 2
Examples
Triangle starts: 1; 3,1; 9,5,2; 28,19,12,5; 90,68,51,33,14;
References
- K. Eriksson and S. Linusson. Combinatorics of Fulton's essential set. Duke Mathematical Journal 85(1):61-76, 1996.
Links
- K. Eriksson and S. Linusson, The size of Fulton's essential set, Electronic J. Combinatorics, Vol. 2, #R6, 1995.
- K. Eriksson and S. Linusson, Combinatorics of Fulton's essential set, ResearchGate, 1998.
Comments