Root regions
Nodes grouped by the interval that contains every root of every row (proved, for all n). A node can have several proved regions; the sharpest is the smallest interval.
Nodes with all roots in (-1, 1) (3)
-
chebyshev_t
1 · 0, 1 · -1, 0, 2 · 0, -3, 0, 4 … row sums 1, 1, 1, 1, 1, 1, 1, 1, …
-
A053117: Triangle read by rows of coefficients of Chebyshev's U(n,x) polynomials (exponents in increasing order).
1 · 0, 2 · -1, 0, 4 · 0, -4, 0, 8 … row sums 1, 2, 3, 4, 5, 6, 7, 8, …
-
chebyshev_u
1 · 0, 2 · -1, 0, 4 · 0, -4, 0, 8 … row sums 1, 2, 3, 4, 5, 6, 7, 8, …