Triangle T(n,k) of the numbers of k-matchings in the n-hypercube graph (0 <= k <= 2^(n-1)).

Terms

a(0) =1a(1) =1a(2) =1a(3) =4a(4) =2a(5) =1a(6) =12a(7) =42a(8) =44a(9) =9a(10) =1a(11) =32a(12) =400a(13) =2496a(14) =8256a(15) =14208a(16) =11648a(17) =3712a(18) =272a(19) =1a(20) =80a(21) =2840a(22) =59120a(23) =803580a(24) =7517264a(25) =49715240a(26) =235146480a(27) =795862790a(28) =1910146160a(29) =3190117800