Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards: number of perfect matchings in the graph C_{2n} x C_k.
A341741
Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards: number of perfect matchings in the graph C_{2n} x C_k.
Terms
- a(0) =2a(1) =8a(2) =2a(3) =14a(4) =36a(5) =2a(6) =36a(7) =50a(8) =200a(9) =2a(10) =82a(11) =272a(12) =224a(13) =1156a(14) =2a(15) =200a(16) =722a(17) =3108a(18) =1058a(19) =6728a(20) =2a(21) =478a(22) =3108a(23) =9922a(24) =39952a(25) =5054a(26) =39204a(27) =2a(28) =1156a(29) =10082
External references
- oeis: A341741