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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028484 Number of perfect matchings in graph C_{13} X P_{2n}. 2
1, 521, 783511, 1380947751, 2539295042077, 4737855988840963, 8887976555024756736, 16707831453322853779391, 31432720082490305392103161, 59153025307098251197953889723, 111332882561747103126702691033059, 209551070271391563571916783497390709 (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

Sergey Perepechko, Table of n, a(n) for n = 0..300

A. M. Karavaev, S. N. Perepechko, Dimer problem on cylinders: recurrences and generating functions, (in Russian), Matematicheskoe Modelirovanie, 2014, V.26, No.11, pp.18-22.

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

Sergey Perepechko, Generating function for A028484

FORMULA

G.f.: see links.

CROSSREFS

Sequence in context: A153180 A173656 A015291 * A057699 A033525 A138647

Adjacent sequences:  A028481 A028482 A028483 * A028485 A028486 A028487

KEYWORD

nonn

AUTHOR

Per H. Lundow

EXTENSIONS

a(10)-a(11) from Alois P. Heinz, Dec 10 2013

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 April 24 12:01 EDT 2019. Contains 322429 sequences. (Running on oeis4.)