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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033532 Number of matchings in graph C_{4} X C_{4} X P_{n}. 1
1, 41025, 13803794944, 3952450882750401, 1149377449671217283137, 333818434084936656186187776, 96963347585045688551801772350785, 28164412862777096850129871275625835649, 8180769830636914759269721968659872494731776, 2376225290581931684771439975937521777947501317377 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(1) = A045310(4), a(2) = A045310(5).

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

Table of n, a(n) for n=0..9.

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

CROSSREFS

Sequence in context: A097479 A249527 A133863 * A173361 A047828 A141711

Adjacent sequences:  A033529 A033530 A033531 * A033533 A033534 A033535

KEYWORD

nonn

AUTHOR

Per H. Lundow

EXTENSIONS

a(8)-a(9) from Alois P. Heinz, Dec 09 2013

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 January 23 10:48 EST 2020. Contains 331171 sequences. (Running on oeis4.)