Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent cycles (0 <= k <= n). An adjacent cycle is a cycle of the form (i, i+1, i+2, ...) (including 1-element cycles).

A184184

Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent cycles (0 <= k <= n). An adjacent cycle is a cycle of the form (i, i+1, i+2, ...) (including 1-element cycles).

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =1a(7) =2a(8) =2a(9) =1a(10) =6a(11) =8a(12) =6a(13) =3a(14) =1a(15) =34a(16) =42a(17) =27a(18) =12a(19) =4a(20) =1a(21) =216a(22) =258a(23) =156a(24) =64a(25) =20a(26) =5a(27) =1a(28) =1566a(29) =1824

External references