|
Search: id:A028486
|
|
|
| A028486 |
|
Number of perfect matchings in graph C_{15} X P_{2n}. |
|
+0
1
|
|
| 1364, 6323504, 35269184041, 207171729355756, 1240837214254999769, 7491895591984935317759, 45390122553039546330628096, 275408624219475075609746445361, 1672150595320335623747680596071399
(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: A119521 A004930 A004950 this_sequence A013592 A152942 A043686
Adjacent sequences: A028483 A028484 A028485 this_sequence A028487 A028488 A028489
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
