Многочлены Чебышёва (Chebyshev Polynomials) Chebyshev Polynomials are a family of orthogonal polynomials that pop up in all kinds of places in math, and they have a lot of quite interesting properties. One characterization of them is that they are the unique polynomials that satisfy \$T_n(\cos(x)) = \cos(nx)\$.
Challenge
Given an nonnegative integer \$n\$, you should output the \$n\$-th Chebyshev Polynomial. \$T_n(x)\$.
Definition
The \$n\$-th Chebyshev Polynomial is given by following three term recursion:
$$\begin{align}
T_0(x) &amp; = 1 \\
T_1(x) &amp; = x \\
T_{n+1}(x) &amp; = 2xT_n(x) - T_{n-1}(x)
\end{align}$$

Details
If your language has a native polynomial type, you can use that one as an output, otherwise you should output a list of coefficients in ascending- or descending order, or as a string representing a polynomial.
This is code-golf so the shortest code in bytes wins
Examples
T0(x) = 1
T1(x) = x 
T2(x) = 2x^2 - 1
T3(x) = 4x^3 - 3 x
T4(x) = 8x^4 - 8x^2 + 1
T5(x) = 16x^5 - 20x^3 + 5x
T10(x) = 512x^10 - 1280x^8 + 1120x^6 - 400x^4 + 50x^2 - 1

In the descending degree list format we'd get T3(x) = [4,0,-3,0] and in the ascending degree format we'd get T3(x) = [0,-3,0,4]
Mathematica, 15 bytes
#~ChebyshevT~x&amp;

Of course, Mathematica has a builtin.
If an alternative input form is allowed (10 bytes):
ChebyshevT

takes an integer n and a variable.