Number of perfect matchings in the C_{2n} X P_3 graph (C_{2n} is the cycle graph on 2n vertices and P_3 is the path graph on 3 vertices).
A102091
Number of perfect matchings in the C_{2n} X P_3 graph (C_{2n} is the cycle graph on 2n vertices and P_3 is the path graph on 3 vertices).
Terms
- a(0) =12a(1) =32a(2) =108a(3) =392a(4) =1452a(5) =5408a(6) =20172a(7) =75272a(8) =280908a(9) =1048352a(10) =3912492a(11) =14601608a(12) =54493932a(13) =203374112a(14) =759002508a(15) =2832635912a(16) =10571541132a(17) =39453528608a(18) =147242573292a(19) =549516764552
External references
- oeis: A102091