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!)
A028451 Number of perfect matchings in graph P_{2} X P_{7} X P_{n}. 2
1, 21, 6272, 880163, 152526845, 24972353440, 4161756233501, 690427159718433, 114725843769441312, 19056798015394695543, 3165986817537284900809, 525966380704787334395776, 87380576637559587656345353, 14516824056706613915897809761, 2411733911295546238838103099168 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
This sequence satisfies a recurrence relation of order 750. - Sergey Perepechko, Jul 11 2019
LINKS
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.
A. M. Karavaev and S. N. Perepechko, Dimer problem on two-layer rectangular grid graph, (in Russian) CMMASS'2013 slides
Sergey Perepechko, Generating function in Maple notation
CROSSREFS
Column k=7 of A181206.
Sequence in context: A074053 A220552 A275053 * A178327 A231906 A250063
KEYWORD
nonn
AUTHOR
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 April 18 06:11 EDT 2024. Contains 371767 sequences. (Running on oeis4.)