|
Search: id:A028472
|
|
|
| A028472 |
|
Number of perfect matchings in graph P_{10} X P_{n}. |
|
+0
2
|
|
| 1, 89, 571, 18061, 185921, 4213133, 53175517, 1031151241, 14479521761, 258584046368, 3852472573499, 65743732590821, 1012747193318519, 16848161392724969, 264499788583572499, 4337452956682508609
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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
|
Row 10 of array A099390.
Adjacent sequences: A028469 A028470 A028471 this_sequence A028473 A028474 A028475
Sequence in context: A061372 A083473 A051416 this_sequence A136646 A063654 A069764
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
