|
Search: id:A028453
|
|
|
| A028453 |
|
Number of perfect matchings in graph P_{3} X P_{4} X P_{n}. |
|
+0
1
|
|
| 11, 1845, 117805, 10885344, 858626465, 72926048233, 5978148553531, 498776151252389, 41250197689850048, 3426717195626372141, 284023348462456779971, 23568180558085521390777
(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: A076168 A053884 A027880 this_sequence A024151 A114354 A167249
Adjacent sequences: A028450 A028451 A028452 this_sequence A028454 A028455 A028456
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
