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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033512 Number of matchings in graph P_{9} X P_{n}. 2
1, 55, 24342, 7594361, 2548684656, 842518533590, 279533139565077, 92657526436631289, 30721240815429999078, 10185111919160666118608, 3376771882017849561260401, 1119528305492897225312120742, 371166848426649070379972358241, 123056076089539426001744759117065 (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..400

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

CROSSREFS

Column k=9 of A210662.

Sequence in context: A221123 A231826 A163036 * A201008 A172722 A221000

Adjacent sequences:  A033509 A033510 A033511 * A033513 A033514 A033515

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 November 30 06:28 EST 2021. Contains 349419 sequences. (Running on oeis4.)