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!)
A241908 Number of perfect matchings in graph P_{13} X P_{2n}. 2
1, 377, 413351, 536948224, 731164253833, 1012747193318519, 1412218550274852671, 1974622635952709613247, 2764079753958605286860951, 3870940598132705729413670953, 5422065916132126528319352874496, 7595338059193606161156363370300487, 10640045682768766172108553992086690201 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

In Karavaev and Perepechko generating functions G_m(x) for P_m X P_n graphs were found for all values of m up to 27.

REFERENCES

A. M. Karavaev and S. N. Perepechko, Generating functions for dimer problem on rectangular lattices (in Russian), Information Processes, 13(2013), No4, 374-400.

LINKS

Table of n, a(n) for n=0..12.

Sergey Perepechko, Generating function for A241908

PROG

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

CROSSREFS

Row 13 of array A099390.

Cf. A028470, A028471, A028472, A028473, A028474, A187596.

Sequence in context: A105717 A222350 A277942 * A198407 A003918 A045197

Adjacent sequences:  A241905 A241906 A241907 * A241909 A241910 A241911

KEYWORD

nonn,easy

AUTHOR

Sergey Perepechko, May 01 2014

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 March 4 20:20 EST 2021. Contains 341799 sequences. (Running on oeis4.)