This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028478 Number of perfect matchings in graph C_{7} X P_{2n}. 1


%S 1,29,1471,79808,4375897,240378643,13209069847,725898384359,

%T 39891876471539,2192269974717929,120476898663671488,

%U 6620847045486150863,363850801995789860221,19995539171949615541457,1098861359580093467365169,60388283471627147242052029

%N Number of perfect matchings in graph C_{7} X P_{2n}.

%D 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.

%H Alois P. Heinz, <a href="/A028478/b028478.txt">Table of n, a(n) for n = 0..500</a>

%H Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.

%F 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

%K nonn,easy

%O 0,2

%A _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 December 5 13:26 EST 2019. Contains 329751 sequences. (Running on oeis4.)