|
Search: id:A028461
|
|
|
| A028461 |
|
Number of perfect matchings in graph P_{3} X C_{4} X P_{n}. |
|
+0
1
|
|
| 32, 6345, 862112, 127027769, 18434590176, 2684514068049, 390673621254528, 56862963807949489, 8276224228029314656, 1204586814571431439961, 175324813971551693097120, 25518128187364758678417065
(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
|
Adjacent sequences: A028458 A028459 A028460 this_sequence A028462 A028463 A028464
Sequence in context: A016793 A123802 A071310 this_sequence A016829 A069052 A086752
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
