login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028473 Number of perfect matchings in graph P_{11} X P_{2n}. 4
1, 144, 51205, 21001799, 8940739824, 3852472573499, 1666961188795475, 722364079570222320, 313196612952258199679, 135818983640055277506397, 58902468764522025160456848, 25545661075321867247577262777, 11079103257893769392837296086025 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

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.

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

Vladeta Jovovic, Explicit formula, generating function and recurrence

PROG

(PARI) {a(n) = sqrtint(polresultant(polchebyshev(2*n, 2, x/2), polchebyshev(11, 2, I*x/2)))} \\ Seiichi Manyama, Apr 13 2020

CROSSREFS

Row 11 of array A099390.

Bisection of A210724 (even part).

Sequence in context: A299953 A230788 A231938 * A130118 A288909 A187169

Adjacent sequences:  A028470 A028471 A028472 * A028474 A028475 A028476

KEYWORD

nonn

AUTHOR

Per H. Lundow

EXTENSIONS

Title corrected by Sergey Perepechko, Nov 27 2012

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 May 31 22:45 EDT 2020. Contains 334756 sequences. (Running on oeis4.)