|
Search: id:A028448
|
|
|
| A028448 |
|
Number of perfect matchings in graph P_{2} X P_{4} X P_{n}. |
|
+0
1
|
|
| 5, 121, 1845, 32000, 535229, 9049169, 152526845, 2573281769, 43402320448, 732106008249, 12348802743437, 208295014563521, 3513435627771565, 59263242055245056, 999628735946792581, 16861339891166667849
(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: A097993 A054752 A128275 this_sequence A108791 A012179 A012026
Adjacent sequences: A028445 A028446 A028447 this_sequence A028449 A028450 A028451
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
