Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).
A076732
Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =2a(5) =3a(6) =1a(7) =4a(8) =9a(9) =8a(10) =1a(11) =6a(12) =21a(13) =44a(14) =45a(15) =1a(16) =8a(17) =39a(18) =128a(19) =265a(20) =264a(21) =1a(22) =10a(23) =63a(24) =284a(25) =905a(26) =1854a(27) =1855a(28) =1a(29) =12
External references
- oeis: A076732