|
Search: id:A028449
|
|
|
| A028449 |
|
Number of perfect matchings in graph P_{2} X P_{5} X P_{n}. |
|
+0
1
|
|
| 8, 450, 14320, 535229, 19114420, 692276437, 24972353440, 901990734650, 32567565264292, 1176040842289105, 42466317504553328, 1533458728878759825, 55373015618048484484, 1999515562849410856778
(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: A013457 A012740 A042525 this_sequence A015006 A054326 A152495
Adjacent sequences: A028446 A028447 A028448 this_sequence A028450 A028451 A028452
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.003 seconds
|
