|
Search: id:A028468
|
|
|
| A028468 |
|
Number of perfect matchings in graph P_{6} X P_{n}. |
|
+0
3
|
|
| 1, 1, 13, 41, 281, 1183, 6728, 31529, 167089, 817991, 4213133, 21001799, 106912793, 536948224, 2720246633, 13704300553, 69289288909, 349519610713, 1765722581057, 8911652846951, 45005025662792
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics I, p. 292.
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.: (1-8*x^2-2*x^3+8*x^4-x^6)/(1-x-20*x^2-10*x^3+38*x^4+10*x^5-20*x^6+x^7+x^8).
|
|
CROSSREFS
|
Row 6 of array A099390.
Sequence in context: A026918 A123972 A141970 this_sequence A102130 A080186 A116153
Adjacent sequences: A028465 A028466 A028467 this_sequence A028469 A028470 A028471
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
