|
| |
|
|
A028471
|
|
Number of perfect matchings (or domino tilings) in the graph P_9 X P_2n.
|
|
2
| |
|
|
1, 55, 6336, 817991, 108435745, 14479521761, 1937528668711, 259423766712000, 34741645659770711, 4652799879944138561, 623139489426439754945, 83456125990631342400791, 11177167872295392172767936
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
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
| a[n] = 209a[n - 1] - 11936a[n - 2] + 274208a[n - 3] - 3112032a[n - 4] + 19456019a[n - 5] - 70651107a[n - 6] + 152325888a[n - 7] - 196664896a[n - 8] + 152325888a[n - 9] - 70651107a[n - 10] + 19456019a[n - 11] - 3112032a[n - 12] + 274208a[n - 13] - 11936a[n - 14] + 209a[n - 15] - a[n - 16]. - Jay Anderson (horndude77(AT)gmail.com), Apr 07 2007
|
|
|
CROSSREFS
| Cf. A000045, A001835, A005178, A003775, A028468, A028469, A028470.
Row 9 of array A099390.
Sequence in context: A116110 A060204 A114049 * A004708 A090813 A145617
Adjacent sequences: A028468 A028469 A028470 * A028472 A028473 A028474
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008 at the suggestion of R. J. Mathar
|
| |
|
|
