A263487 Triangle read by rows: T(n,k) (n>=2, k>=0) is the number of permutations of n having a subexpression of maximal defect k.

2, 5, 1, 13, 7, 4, 34, 33, 36, 12, 4, 1

Offset

2,1

Comments

Row sums give A000142, n >= 2.

Links

Table of n, a(n) for n=2..13.

V. V. Deodhar, A combinatorial setting for questions in Kazhdan-Lusztig theory, Geometriae Dedicata, October 1990, Volume 36, Issue 1, pp 95-119, MR1065215.

FindStat - Combinatorial Statistic Finder, The maximum defect over any reduced expression for a permutation and any subexpression.

Example

Triangle begins:
2,
5,1,
13,7,4,
34,33,36,12,4,1,
...

Crossrefs

Cf. A000142.

Sequence in context: A207614 A156067 A352577 * A101920 A114494 A118964

Adjacent sequences: A263484 A263485 A263486 * A263488 A263489 A263490

Keyword

nonn,tabf,more

Author

Christian Stump, Oct 19 2015

Status

approved