Triangular array read by rows: T(n,k) is the number of derangements whose shortest cycle has exactly k nodes; n >= 1, 1 <= k <= n.

A348075

Triangular array read by rows: T(n,k) is the number of derangements whose shortest cycle has exactly k nodes; n >= 1, 1 <= k <= n.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =0a(5) =2a(6) =0a(7) =3a(8) =0a(9) =6a(10) =0a(11) =20a(12) =0a(13) =0a(14) =24a(15) =0a(16) =105a(17) =40a(18) =0a(19) =0a(20) =120a(21) =0a(22) =714a(23) =420a(24) =0a(25) =0a(26) =0a(27) =720a(28) =0a(29) =5845

External references