OFFSET
1,2
REFERENCES
J. Propp, Enumeration of matchings: problems and progress, pp. 255-291 in L. J. Billera et al., eds, New Perspectives in Algebraic Combinatorics, Cambridge, 1999 (see Problem 27).
LINKS
J. Propp, Updated article
J. Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics
FORMULA
Conjecture from Seiichi Manyama, Jan 04 2021: (Start)
a(2*n+1) = A340291(n) = 4^(2*n^2) * Product_{1<=j,k<=n} (1 - cos(j*Pi/(2*n+1))^2 * cos(k*Pi/(2*n+1))^2).
a(2*n) = 2 * 4^(2*(n-1)) * A340166(n) = 2 * 4^(2*(n-1)*n) * Product_{1<=j,k<=n-1} (1 - cos(j*Pi/(2*n))^2 * cos(k*Pi/(2*n))^2). (End)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, May 28 2002
STATUS
approved