|
Search: id:A028455
|
|
|
| A028455 |
|
Number of perfect matchings in graph P_{2} X C_{3} X P_{n}. |
|
+0
1
|
|
| 4, 50, 444, 4349, 41348, 396733, 3795912, 36350866, 348013000, 3332060177, 31902067752, 305441725601, 2924400160544, 27999196885618, 268073721835248, 2566628109851821, 24573761479828684
(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: A087588 A027533 A048559 this_sequence A114480 A123356 A139087
Adjacent sequences: A028452 A028453 A028454 this_sequence A028456 A028457 A028458
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
