|
Search: id:A033532
|
|
|
| A033532 |
|
Number of matchings in graph C_{4} X C_{4} X P_{n} |
|
+0
2
|
|
| 41025, 13803794944, 3952450882750401, 1149377449671217283137, 333818434084936656186187776, 96963347585045688551801772350785, 28164412862777096850129871275625835649
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(0)=A045310(3), a(1)=A045310(4).
|
|
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
|
Sequence in context: A097238 A046180 A133863 this_sequence A047828 A141711 A074379
Adjacent sequences: A033529 A033530 A033531 this_sequence A033533 A033534 A033535
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Per Hakan Lundow (phl(AT)theophys.kth.se)
|
|
|
Search completed in 0.002 seconds
|
