|
|
A231087
|
|
Number of perfect matchings in graph C_3 x C_{2n}
|
|
9
|
|
|
50, 224, 1058, 5054, 24200, 115934, 555458, 2661344, 12751250, 61094894, 292723208, 1402521134, 6719882450, 32196891104, 154264573058, 739125974174, 3541365297800, 16967700514814, 81297137276258, 389517985866464, 1866292792056050, 8941945974413774, 42843437080012808, 205275239425650254
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2*(((sqrt(7)+sqrt(3))/2)^n + ((sqrt(7)-sqrt(3))/2)^n)^2.
G.f.: 2*x^2*(25-38*x+7*x^2)/((1-x)*(1-5*x+x^2)).
a(n) = sqrt( Product_{j=1..n} Product_{k=1..3} (4*sin((2*j-1)*Pi/(2*n))^2 + 4*sin((2*k-1)*Pi/3)^2) ).
a(n) = 5*a(n-1) - a(n-2) - 12. (End)
|
|
PROG
|
(PARI) Vec(2*x^2*(25-38*x+7*x^2)/((1-x)*(1-5*x+x^2))+O(x^66)) \\ Joerg Arndt, Nov 03 2013
(PARI) default(realprecision, 120);
a(n) = round(sqrt(prod(j=1, n, prod(k=1, 3, 4*sin((2*j-1)*Pi/(2*n))^2+4*sin((2*k-1)*Pi/3)^2)))); \\ Seiichi Manyama, Feb 14 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|