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.

A146961 Numbers k = p*q*r, with odd primes p < q < r, such that Sister Beiter's cyclotomic coefficient conjecture is false.

Original entry on oeis.org

20213, 125609, 136477, 141317, 150271, 198493, 199177, 212971, 239039, 273229, 282367, 291343, 311201, 332777, 373901, 393313, 398563, 412357, 442091, 449527, 449647, 450131, 456569, 461263, 469249, 470741, 475057, 522461, 524837, 532363
Offset: 1

Views

Author

T. D. Noe, Nov 03 2008

Keywords

Comments

In 1968, Sister Beiter conjectured that for k = p*q*r, with odd primes p < q < r, the maximum coefficient (in absolute value) of the cyclotomic polynomial Phi(k,x) is <= (p+1)/2. Up to 10^6, all counterexamples have p > 7. Gallot and Moree prove the conjecture is false for p > 7.

Crossrefs

Subsequence of A046389.

Programs

  • PARI
    isok(m) = if ((m%2) && (bigomega(m)==3) && (omega(m)==3), my(p=vecmin(factor(m)[,1])); vecmax(apply(abs, Vec(polcyclo(m)))) > (p+1)/2;); \\ Michel Marcus, Jan 16 2023
    
  • Sage
    from sage.rings.polynomial.cyclotomic import cyclotomic_coeffs
    for n in range(3, 100000, 2):
        pqr = Integer(n).prime_factors()
        if (len(pqr) == 3) and (product(pqr) == n):
            coeffs = cyclotomic_coeffs(n, sparse=False)
            max_coeff = max(abs(c) for c in coeffs)
            if (max_coeff > (pqr[0]+1)//2): print(n)  # Robin Visser, Aug 17 2023