Triangle read by rows: T(n,k) = number of permutations of [n] having exactly one adjacent k-cycle. (n>=1, 1<=k<=n).

A370527

Triangle read by rows: T(n,k) = number of permutations of [n] having exactly one adjacent k-cycle. (n>=1, 1<=k<=n).

Terms

    a(0) =1a(1) =0a(2) =1a(3) =3a(4) =2a(5) =1a(6) =8a(7) =4a(8) =2a(9) =1a(10) =45a(11) =18a(12) =6a(13) =2a(14) =1a(15) =264a(16) =99a(17) =22a(18) =6a(19) =2a(20) =1a(21) =1855a(22) =612a(23) =114a(24) =24a(25) =6a(26) =2a(27) =1a(28) =14832a(29) =4376

External references