Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127670 Discriminants of Chebyshev S-polynomials A049310. +0
3
1, 4, 32, 400, 6912, 153664, 4194304, 136048896, 5120000000, 219503494144, 10567230160896, 564668382613504, 33174037869887488, 2125764000000000000, 147573952589676412928, 11034809241396899282944, 884295678882933431599104 (list; graph; listen)
OFFSET

1,2

REFERENCES

Theodore J. Rivlin, Chebyshev polynomials: from approximation theory to algebra and number theory, 2. ed., Wiley, New York, 1990; p. 219 for T and U polynomials.

FORMULA

a(n)= ((n+1)^{n-2})*2^n, n>=1.

a(n)= Det(Vn(xn[1],..,xn[n]))^2 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]:=2*cos(Pi*i/(n+1)), i=1,..,n, are the zeros of S(n,x):=U(n,x/2).

a(n)= ((-1)^(n*(n-1)/2))*product(diff(S(n,x))|_{x=xn[j]},j=1..n)), n>=1, with the zeros xn[j],j=1..n, given above.

CROSSREFS

Cf. A007701 (T-polynomials), A086804 (U-polynomials).

Sequence in context: A007763 A005263 A113131 this_sequence A005172 A140178 A088991

Adjacent sequences: A127667 A127668 A127669 this_sequence A127671 A127672 A127673

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Jan 23 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research