login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028462 Number of perfect matchings in graph P_{3} X C_{5} X P_{2n}. 0
1, 29213, 3729856656, 550010117858551, 82488986661106452273, 12399477876511724386970911, 1864438246325261673678557608521, 280357398532807126891406612003534608, 42157883453596571760224856937456538736971, 6339368086045107439875364633706616894779758991 (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..9.

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

CROSSREFS

Sequence in context: A015313 A242741 A152939 * A252860 A206470 A194619

Adjacent sequences:  A028459 A028460 A028461 * A028463 A028464 A028465

KEYWORD

nonn

AUTHOR

Per H. Lundow

EXTENSIONS

a(8)-a(9) from Alois P. Heinz, Dec 10 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 1 00:56 EDT 2022. Contains 357127 sequences. (Running on oeis4.)