|
Search: id:A028463
|
|
|
| A028463 |
|
Number of perfect matchings in graph P_{4} X C_{4} X P_{n}. |
|
+0
1
|
|
| 121, 155969, 127027769, 114249681408, 101177745416793, 89966299634302561, 79958827951928352569, 71078263639970542379841, 63183478420387429145703424, 56166200950909879145980135745
(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: A121013 A129450 A082489 this_sequence A013749 A135825 A082215
Adjacent sequences: A028460 A028461 A028462 this_sequence A028464 A028465 A028466
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
