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.

Showing 1-1 of 1 results.

A086327 Number of factors over Q in the factorization of the Chebyshev polynomial of the second kind U_n(x).

Original entry on oeis.org

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

Views

Author

Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 30 2003

Keywords

Comments

Initial terms are consistent with A069930(n+1). - Andrew Howroyd, Jul 10 2018
a(n) = A069930(n+1) at least for the first 1515 terms. - Antti Karttunen, Sep 25 2018

Crossrefs

Cf. A001227 (number of factors of Chebyshev polynomials of 1st kind).

Programs

  • PARI
    a(n)={vecsum(factor(polchebyshev(n, 2, x))[, 2])} \\ Andrew Howroyd, Jul 10 2018

Extensions

a(11) corrected and a(19)-a(85) from Andrew Howroyd, Jul 10 2018
Terms a(86)-a(105) from Antti Karttunen, Sep 25 2018
Showing 1-1 of 1 results.