37566

Appears in sequences

• Number T(n,k) of entries in the k-th cycles of all permutations of {1,2,..,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.at n=30A185105
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=26A221597
• Number of entries in the third cycles of all permutations of [n].at n=5A285231
• Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] without consecutive adjacent values.at n=52A338526