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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028459 Number of perfect matchings in graph P_{2} X C_{7} X P_{n}. 0
1, 29, 10082, 1806059, 387692373, 79727046876, 16625358222661, 3457730603494265, 720015359158627776, 149916811809805555003, 31218852023490816278025, 6501135563145633946274820, 1353847711415498081767856265, 281937394302518125069427284433 (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 report, No 12, 1996, Department of Math., Umea University, Sweden.

LINKS

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

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

CROSSREFS

Sequence in context: A265464 A103656 A201489 * A199369 A127425 A135253

Adjacent sequences:  A028456 A028457 A028458 * A028460 A028461 A028462

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 September 20 21:24 EDT 2021. Contains 347590 sequences. (Running on oeis4.)