

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.


0



2, 5, 1, 13, 7, 4, 34, 33, 36, 12, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



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 KazhdanLusztig theory, Geometriae Dedicata, October 1990, Volume 36, Issue 1, pp 95119, 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: A207629 A207614 A156067 * A101920 A114494 A118964
Adjacent sequences: A263484 A263485 A263486 * A263488 A263489 A263490


KEYWORD

nonn,tabf,more


AUTHOR

Christian Stump, Oct 19 2015


STATUS

approved



