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



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”).

(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)



This sequence satisfies a recurrence relation of order 750. - Sergey Perepechko, Jul 11 2019


Alois P. Heinz, Table of n, a(n) for n = 0..450

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.

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

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


Column k=7 of A181206.

Sequence in context: A074053 A220552 A275053 * A178327 A231906 A250063

Adjacent sequences:  A028448 A028449 A028450 * A028452 A028453 A028454




Per H. Lundow



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 16:23 EST 2021. Contains 349423 sequences. (Running on oeis4.)