|
|
A212206
|
|
Irregular triangle read by rows: T(n,k) = number of "pat" permutations of [1..n] with k descents.
|
|
1
|
|
|
1, 0, 1, 0, 2, 0, 1, 4, 0, 0, 12, 2, 0, 0, 12, 30, 0, 0, 4, 100, 28, 0, 0, 0, 140, 280, 9, 0, 0, 0, 90, 980, 360, 0, 0, 0, 22, 1680, 2940, 220, 0, 0, 0, 0, 1540, 10584, 4620, 52, 0, 0, 0, 0, 728, 20790, 33264, 4004, 0, 0, 0, 0, 140, 24024, 121968, 60060, 1820, 0, 0, 0, 0, 0, 16380, 264264, 396396, 65520, 340, 0, 0, 0, 0, 0, 6120
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Row sums are Catalan numbers A000108.
|
|
LINKS
|
Tad White, Quota Trees, arXiv:2401.01462 [math.CO], 2024. See p. 20.
|
|
FORMULA
|
T(n,k) = binomial(2n-2k-1,k)*binomial(2k,n-k-1)/(2n-2k-1).
|
|
EXAMPLE
|
Triangle begins:
1
0 1
0 2
0 1 4
0 0 12 2
0 0 12 30
0 0 4 100 28
0 0 0 140 280 9
0 0 0 90 980 360
0 0 0 22 1680 2940 220
...
|
|
MAPLE
|
binomial(2*n-2*k-1, k)*binomial(2*k, n-k-1)/(2*n-2*k-1) ;
end proc:
for n from 0 to 15 do
for k from 0 to floor((2*n-1)/3) do
end do:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|