login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033522 Number of matchings in graph C_{10} X P_{n}. 1
1, 123, 117732, 85579087, 65035723280, 49125060601108, 37140865202938885, 28076586641702173315, 21224865471367565301932, 16045172079162180370051008, 12129530424108426130365136337, 9169456015979482738524196819196, 6931754273289828570289322265111621 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

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

Alois P. Heinz, Table of n, a(n) for n = 0..200

Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.

CROSSREFS

Row 10 of A287428.

Sequence in context: A181006 A289331 A334181 * A214464 A288353 A080537

Adjacent sequences:  A033519 A033520 A033521 * A033523 A033524 A033525

KEYWORD

nonn

AUTHOR

Per H. Lundow

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 4 15:57 EST 2020. Contains 338929 sequences. (Running on oeis4.)