Triangle T(n,k) read by rows where T(n,k) is the number of ménage permutations that map 1 to k, with 3 <= k <= n.

A332709

Triangle T(n,k) read by rows where T(n,k) is the number of ménage permutations that map 1 to k, with 3 <= k <= n.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =4a(4) =5a(5) =4a(6) =20a(7) =20a(8) =20a(9) =20a(10) =115a(11) =116a(12) =117a(13) =116a(14) =115a(15) =787a(16) =791a(17) =791a(18) =791a(19) =791a(20) =787a(21) =6184a(22) =6203a(23) =6204a(24) =6205a(25) =6204a(26) =6203a(27) =6184a(28) =54888a(29) =55000

External references