proposed
approved
proposed
approved
editing
proposed
D-finite recurrence for columns: T(n,k) = n*T(n-1,k) + (n-k)*T(n-2,k). - Georg Fischer, Aug 13 2022
proposed
editing
editing
proposed
E. Emeric Deutsch and S. Elizalde, <a href="http://arxiv.org/abs/0904.2792">The largest and the smallest fixed points of permutations</a>, arXiv:0904.2792 [math.CO], 2009.
Philip Feinsilver, and John McSorley, <a href="https://arxiv.org/abs/1710.00788">Zeons, Permanents, the Johnson scheme, and Generalized Derangements</a>, arXiv:1710.00788 [math.CO], (2017); see page 29.
proposed
editing
editing
proposed
Row sums give A002467. Diagonals include A000166, A000255, A055790, A000142.
Diagonals give A000142, A001563, A001564, A001565, A001688, A001689, A023043, A023044, A023045, A023046, A023047 (factorials and k-th differences, k=1..10).
When seen as an array, main diagonal is A033815.
T(2*n, n) is A033815.
Columns k=0..10 give A000166, A000255, A055790, A277609, A277563, A280425, A280920, A284204, A284205, A284206, A284207.
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed