368040

Appears in sequences

• Array read by antidiagonals: T(m,n) = Sum(1<=i<=m) ( n + 2(i-1) )!at n=23A211368
• Number of occurrences of k in the list of transitions t(j), j <= n!-1, of interchanges a(t(j)) <-> a(t(j)+1) created by Knuth's "Algorithm T" (Plain change transitions) to generate all permutations of n distinct elements, written as a triangle T(m,k), m = n-1 >= 1, k <= m.at n=39A321668