OFFSET
2,2
COMMENTS
Even-indexed rows have length n - 1; odd-indexed rows have length n - 2.
Conjecture: T(n, 1) = 2^(n-2).
T(2n, 2n-1) = 1, since there is only one derangement of 2n letters with 2n-1 descents.
The analogous sequence for permutations is T'(n, k) = 1. That is, the expected value of the first letter of a permutation with k descents is an integer (namely k + 1).
EXAMPLE
Triangle begins:
1;
2;
4, 1, 1;
8, 3, 4;
16, 104, 40, 24, 1;
32, 392, 896, 480, 54;
64, 152, 308, 1496, 63, 108, 1;
128, 2276, 30384, 14410, 4315, 3024, 14.
T(4,1) = 4 because the derangements of four letters with one descent are
[2,3,4,1], [2,4,1,3], [3,4,1,2], and [4,1,2,3], and the expected value of the first letter is (2+2+3+4)/4 = 11/4, which has 4 as its denominator.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Peter Kagey, Feb 04 2020
STATUS
approved