|
Search: id:A028459
|
|
|
| A028459 |
|
Number of perfect matchings in graph P_{2} X C_{7} X P_{n}. |
|
+0
1
|
|
| 29, 10082, 1806059, 387692373, 79727046876, 16625358222661, 3457730603494265, 720015359158627776, 149916811809805555003, 31218852023490816278025, 6501135563145633946274820, 1353847711415498081767856265
(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: A125074 A033519 A103656 this_sequence A127425 A135253 A159437
Adjacent sequences: A028456 A028457 A028458 this_sequence A028460 A028461 A028462
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
