login
A188890
a(n) = 2^(n^2*2)*A004003(n).
1
1, 8, 9216, 1763704832, 55786539933761536, 291139753716719964894789632, 250571020614762113258116708732764160000, 35558299325468842404742419202148426327085023232000000, 831952537599396321581603077837672266625608464198409017861335832068096
OFFSET
0,2
COMMENTS
The formula on line 3 of page 320 of the Levin et al. book has a typo: 2^(nm) should be 2^(mn/2). The main diagonal of the erroneous formula gives the present sequence.
REFERENCES
Levin, David A.; Peres, Yuval; and Wilmer, Elizabeth L.; Markov Chains and Mixing Times, American Mathematical Society, Providence, RI, 2009.
LINKS
FORMULA
a(n)^2 = Resultant(U(2*n,x), U(2*n,i*x)), where U(n,x) is a Chebyshev polynomial of the second kind and i = sqrt(-1). - Seiichi Manyama, Apr 14 2020
a(n) ~ 2^(2*n^2 + 1) * (sqrt(2)-1)^(2*n+1) * exp(G*(2*n+1)^2/Pi), where G is Catalan's constant A006752. - Vaclav Kotesovec, Apr 14 2020, updated Jan 03 2021
MAPLE
f:=(m, n)->
2^(m*n)*mul( mul(
(cos(Pi*i/(n+1))^2+cos(Pi*j/(m+1))^2), j=1..m/2), i=1..n/2);
g:=(m, n)->round(evalf(f(m, n), 300));
t1:=[seq(g(2*n, 2*n), n=0..10)];
MATHEMATICA
Table[Sqrt[Resultant[ChebyshevU[2*n, x], ChebyshevU[2*n, I*x], x]], {n, 0, 10}] (* Vaclav Kotesovec, Apr 14 2020 *)
PROG
(PARI) {a(n) = sqrtint(polresultant(polchebyshev(2*n, 2, x), polchebyshev(2*n, 2, I*x)))} \\ Seiichi Manyama, Apr 14 2020
(Python)
from math import isqrt
from sympy import resultant, chebyshevu, I
from sympy.abc import x
def A188890(n): return isqrt(resultant(chebyshevu(n<<1, x), chebyshevu(n<<1, I*x))) if n else 1 # Chai Wah Wu, Nov 08 2023
CROSSREFS
Cf. A004003.
Sequence in context: A230397 A230570 A055308 * A175881 A165429 A343475
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 12 2011
STATUS
approved