Original entry on oeis.org
1, 229, 117805, 64647289, 35669566217, 19690797527709, 10870506600976757, 6001202979497804657, 331304283062403135451, 1829008840116358153050197, 1009728374600381843221483965
Offset: 0
A028454
Number of perfect matchings in graph P_{4} X P_{4} X P_{n}.
Original entry on oeis.org
1, 36, 32000, 10885344, 5051532105, 2132137503232, 932814464901633, 403325499406267520, 175220727982196365632, 75996591204223021534740, 32983893365927357595999561, 14312021563707748863632803328, 6210770058902782255142931025577
Offset: 0
- Alois P. Heinz, Table of n, a(n) for n = 0..100
- Per Hakan Lundow, Computation of matching polynomials and the number of 1-factors in polygraphs, Research report, No 12, 1996, Department of Math., Umea University, Sweden.
- Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
A049507
Number of perfect matchings in graph P_{6} x P_{6} x P_{n}.
Original entry on oeis.org
1, 6728, 53786626921, 57248060375968384, 123115692449982216049513, 216388579168758145017797108072
Offset: 0
Showing 1-3 of 3 results.