|
Search: id:A086804
|
|
|
| A086804 |
|
a(0)=0; for n>0, a(n) = (n+1)^(n-2)*2^(n^2). |
|
+0 3
|
|
| 0, 1, 16, 2048, 1638400, 7247757312, 164995463643136, 18446744073709551616, 9803356117276277820358656, 24178516392292583494123520000000, 271732164163901599116133024293512544256
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Discriminant of Chebyshev polynomial U_n (x) of second kind.
|
|
REFERENCES
|
Theodore J. Rivlin, Chebyshev polynomials: from approximation theory to algebra and number theory, 2. ed., Wiley, New York, 1990; p. 219, 5.1.2.
|
|
LINKS
|
Index entries for sequences related to Chebyshev polynomials.
|
|
FORMULA
|
a(n)=((n+1)^(n-2))*2^(n^2), n>=1, a(0):=0.
a(n)=((2^(2*(n-1)))*Det(Vn(xn[1],..,xn[n])))^2, n>=1, with the determinant of the Vandermonde matrix Vn with elements (Vn)i,j:= xn[i]^j, i=1..n,j=0..n-1, and xn[i]:=cos(Pi*i/(n+1)), i=1,..,n, are the zeros of the Chebyshev U(n,x) polynomials.
a(n)= ((-1)^(n*(n-1)/2))*(2^(n*(n-2)))*product(diff(U(n,x),x)|_{x=xn[i]},i=1..n)), n>=1, with the zeros xn[i],i=1..n, given above.
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, (n+1)^(n-2)*2^(n^2))
(PARI) a(n)=if(n<1, 0, n++; poldisc(poltchebi(n)'/n))
|
|
CROSSREFS
|
Cf. A007701.
Cf. A127670 (discriminant for S-polynomials).
Sequence in context: A054947 A071900 A075413 this_sequence A121366 A065776 A101800
Adjacent sequences: A086801 A086802 A086803 this_sequence A086805 A086806 A086807
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 05 2003
|
|
EXTENSIONS
|
Formula and more terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 07 2003
|
|
|
Search completed in 0.002 seconds
|