This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028477 Number of perfect matchings in graph C_{6} X P_{n}. 0


%S 1,2,20,108,725,4480,28561,179928,1138660,7193450,45474461,287400960,

%T 1816564229,11481464878,72568802500,458669938608,2899021855801,

%U 18323243845760,115811947027949,731988596166300,4626528972901940,29241944603930518,184823511249946969

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

%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 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^4 +2*x^3 -4*x^2 -2*x +1) / (x^6 +4*x^5 -16*x^4 -6*x^3 +16*x^2 +4*x -1).

%K nonn

%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 November 19 11:09 EST 2019. Contains 329319 sequences. (Running on oeis4.)