|
Search: id:A028454
|
|
|
| A028454 |
|
Number of perfect matchings in graph P_{4} X P_{4} X P_{n}. |
|
+0
1
|
|
| 36, 32000, 10885344, 5051532105, 2132137503232, 932814464901633, 403325499406267520, 175220727982196365632, 75996591204223021534740, 32983893365927357595999561, 14312021563707748863632803328
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
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.
|
|
LINKS
|
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
CROSSREFS
|
Sequence in context: A067584 A146521 A159431 this_sequence A159435 A123397 A023111
Adjacent sequences: A028451 A028452 A028453 this_sequence A028455 A028456 A028457
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
