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!)
A033525 Number of matchings in graph C_{13} X P_{n}. 1

%I #10 May 25 2017 14:40:50

%S 1,521,3909830,20515048427,114049219978023,629054823210684476,

%T 3473775971752370727131,19179686041473059942755365,

%U 105899042012449225094998682338,584710646991236367599977270008305,3228421282256766290943315048262784813

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

%D Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research reports, No 12, 1996, Department of Mathematics, Umea University.

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

%Y Row 13 of A287428.

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 09:14 EDT 2024. Contains 371268 sequences. (Running on oeis4.)