Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).

A076731

Table T(n,k) giving number of ways of obtaining exactly 0 correct answers on an (n,k)-matching problem (1 <= k <= n).

Terms

    a(0) =0a(1) =1a(2) =1a(3) =2a(4) =3a(5) =2a(6) =3a(7) =7a(8) =11a(9) =9a(10) =4a(11) =13a(12) =32a(13) =53a(14) =44a(15) =5a(16) =21a(17) =71a(18) =181a(19) =309a(20) =265a(21) =6a(22) =31a(23) =134a(24) =465a(25) =1214a(26) =2119a(27) =1854a(28) =7a(29) =43

External references