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.

A160493 Maximum height of the third-order cyclotomic polynomial Phi(pqr,x) with p

Original entry on oeis.org

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

Views

Author

T. D. Noe, May 15 2009

Keywords

Comments

The height of a polynomial is the maximum of the absolute value of its coefficients. Sequence A046388 gives increasing values of pq. As proved by Kaplan, to compute the maximum height of Phi(pqr,x) for any prime r, there are only (p-1)(q-1)/2 values of r to consider. The set s of values of r can be taken to be primes greater than q such that the union of s and -s (mod pq) contains every number less than and coprime to pq. It appears that when p=3, the maximum height is 2; when p=5, the maximum is 3; when p=7, the maximum is 3 or 4; and when p=11, the maximum is no greater than 7.

Crossrefs

Formula

a(n) = maximum height of Phi(A046388(n)*r,x) for any prime r>q.