|
Search: id:A028469
|
|
|
| A028469 |
|
Number of perfect matchings in graph P_{7} X P_{2n}. |
|
+0
3
|
|
| 21, 781, 31529, 1292697, 53175517, 2188978117, 90124167441, 3710708201969, 152783289861989, 6290652543875133, 259009513044645817, 10664383939345916681, 439092316687230373293, 18079062471131097321077
(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.
|
|
FORMULA
|
G.f.: (-x^7 + 55*x^6 - 637*x^5 + 2355*x^4 - 3367*x^3 + 1905*x^2 - 395*x + 21)/(x^8 - 56*x^7 + 672*x^6 - 2632*x^5 + 4094*x^4 - 2632*x^3 + 672*x^2 - 56*x + 1).
|
|
CROSSREFS
|
Row 7 of array A099390.
Sequence in context: A062755 A012850 A012645 this_sequence A119414 A012819 A041843
Adjacent sequences: A028466 A028467 A028468 this_sequence A028470 A028471 A028472
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
