cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A086375 Number of factors over Q in the factorization of U_n(x) + 1 where U_n(x) is the Chebyshev polynomial of the second kind.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 3, 3, 3, 6, 2, 4, 4, 5, 4, 5, 2, 7, 4, 4, 4, 8, 3, 4, 5, 6, 4, 8, 2, 8, 4, 3, 6, 9, 4, 5, 4, 8, 4, 8, 2, 8, 6, 4, 6, 10, 3, 6, 5, 7, 4, 8, 4, 10, 6, 4, 4, 12, 2, 6, 6, 7, 8, 7, 4, 8, 4, 8, 4, 14, 2, 5, 6, 6, 8, 8, 4, 12, 5, 4, 5, 12, 4, 6, 6, 8, 4, 12, 4, 10, 6, 4, 6, 12, 4, 6, 6, 10, 6, 9
Offset: 1

Views

Author

Yuval Dekel (dekelyuval(AT)hotmail.com), Sep 06 2003

Keywords

Examples

			a(7)=3 because 1+U(7,x)=1+128x^7-192x^5+80x^3-8x=(2x+1)(8x^3-6x+1)(8x^3-4x^2-4x+1).
		

Crossrefs

Cf. A086327.
Cf. A086374.

Programs

  • PARI
    p2 = 1; p1 = 2*x; for (n = 1, 103, p = 2*x*p1 - p2; f = factor(p1 + 1); print(sum(i = 1, matsize(f)[1], f[i, 2]), " "); p2 = p1; p1 = p); \\ David Wasserman, Mar 02 2005

Extensions

More terms from David Wasserman and Emeric Deutsch, Mar 02 2005