|
Search: id:A033506
|
|
|
| A033506 |
|
Number of matchings in graph P_{3} X P_{n} |
|
+0
2
|
|
| 3, 22, 131, 823, 5096, 31687, 196785, 1222550, 7594361, 47177097, 293066688, 1820552297, 11309395995, 70254767718, 436427542283, 2711118571311, 16841658983944, 104621568809247, 649916534985369, 4037327172325542
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research reports, No 12, 1996, Department of Mathematics, Umea University.
|
|
LINKS
|
Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.
|
|
CROSSREFS
|
Cf. A030186, A033507, A033508, A033509, A033510, A033511.
Sequence in context: A061182 A006283 A100511 this_sequence A091639 A091636 A110469
Adjacent sequences: A033503 A033504 A033505 this_sequence A033507 A033508 A033509
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
