|
Search: id:A028466
|
|
|
| A028466 |
|
Number of perfect matchings in graph C_{3} X C_{5} X P_{2n}. |
|
+0
1
|
|
| 106784, 56850678464, 32898111133723321, 19096119789145305208336, 11085838411090123868197412129, 6435670258948861016802884153464799, 3736105167546089403361511734752297982336
(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: A013889 A025308 A025290 this_sequence A122711 A061332 A102333
Adjacent sequences: A028463 A028464 A028465 this_sequence A028467 A028468 A028469
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
