login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028478 Number of perfect matchings in graph C_{7} X P_{2n}. 1
1, 29, 1471, 79808, 4375897, 240378643, 13209069847, 725898384359, 39891876471539, 2192269974717929, 120476898663671488, 6620847045486150863, 363850801995789860221, 19995539171949615541457, 1098861359580093467365169, 60388283471627147242052029 (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

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

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

FORMULA

G.f.: (x^7 -42*x^6 +364*x^5 -1001*x^4 +1001*x^3 -364*x^2 +42*x -1)/( -x^8 +71*x^7 -952*x^6 +3976*x^5 -6384*x^4 +3976*x^3 -952*x^2 +71*x -1). - Alois P. Heinz, Dec 09 2013

CROSSREFS

Sequence in context: A049657 A091994 A126555 * A042627 A042624 A190826

Adjacent sequences:  A028475 A028476 A028477 * A028479 A028480 A028481

KEYWORD

nonn,easy

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 November 22 18:55 EST 2019. Contains 329410 sequences. (Running on oeis4.)