Given an integer n ≥ 0, generate the n-th Chebyshev polynomial of the 2nd Kind.
Examples:
chebyshev2ndKindPoly(0)
ans =
1 chebyshev2ndKindPoly(1)
ans =
2 0 chebyshev2ndKindPoly(2)
ans =
4 0 -1Neither string operations nor interpolations are allowed!
Solution Stats
Problem Recent Solvers39
Suggested Problems
-
771 Solvers
-
600 Solvers
-
Number of 1s in a binary string
1119 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
141 Solvers
-
41 Solvers
More from this Author18
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags