|
Search: id:A028481
|
|
|
| A028481 |
|
Number of perfect matchings in graph C_{10} X P_{n}. |
|
+0
1
|
|
| 2, 125, 1452, 37584, 631750, 13344409, 248864088, 4964424625, 95464562688, 1872712598261, 36340255066500, 709361528836661, 13802335712555182, 269027285006250000, 5238744073324512432, 102066374099541816889
(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: A065705 A042921 A123006 this_sequence A049659 A157070 A064070
Adjacent sequences: A028478 A028479 A028480 this_sequence A028482 A028483 A028484
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
