87138394540
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent 4-cycles (0 <= k <= floor(n/4)), i.e., having k cycles of the form (i, i+1, i+2, i+3).at n=32A177252
- Number of permutations of [n] having no adjacent 4-cycles, i.e., no cycles of the form (i, i+1, i+2, i+3).at n=14A177253
- Number of permutations of [n] having exactly one adjacent 4-cycle.at n=17A369098