cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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).

Original entry on oeis.org

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

Views

Author

Emeric Deutsch, May 29 2008

Keywords

Comments

Sum of entries in row n is 4^(n-2) (A000302).
T(n,0)=A000245(n-1).
T(n,n-2)=Cat(n-2)=A000108(n-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.

Crossrefs

Showing 1-1 of 1 results.