editing
approved
editing
approved
T(2n,n) gives A360426.
approved
editing
editing
approved
T:= proc(n, k) option remember; `if`(n<2, 0, `if`(k=1, 1,
k*T(n-1, k) + 2*T(n-1, k-1) + (n-k)*T(n-1, k-2)))
end:
seq(seq(T(n, k), k=1..n-1), n=2..12); # Alois P. Heinz, Feb 08 2023
1, 1, 2, 1, 6, 5, 1, 14, 29, 16, 1, 30, 118, 150, 61, 1, 62, 418, 926, 841, 272, 1, 126, 1383, 4788, 7311, 5166, 1385, 1, 254, 4407, 22548, 51663, 59982, 34649, 7936, 1, 510, 13736, 100530, 325446, 553410, 517496, 252750, 50521, 1, 1022, 42236, 433162, 1910706, 4474002, 6031076, 4717222, 1995181, 353792
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
Désiré André, <a href="httphttps://www.numdamdoi.org/numdam-bin10.24033/item?id=ASENS_1884_3_1__121_0asens.235">Etude sur les maxima, minima et sequences des permutations</a>, Ann. Sci. Ecole Norm. Sup., 3, no. 1 (1884), 121-135.
M. Bona and R. Ehrenborg, <a href="httphttps://arXivarxiv.org/abs/math.CO/9902020">A combinatorial proof of the log-concavity of the numbers of permutations with k runs</a>, arXiv:math/9902020 [math.CO], 1999.
proposed
editing
editing
proposed