86701097310
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent 3-cycles (0 <= k <= floor(n/3)), i.e., having k cycles of the form (i, i+1, i+2).at n=40A177250
- Number of permutations of [n] having no adjacent 3-cycles, i.e., no cycles of the form (i, i+1, i+2).at n=14A177251
- Number of permutations of [n] having exactly one adjacent 3-cycle.at n=16A370525