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-2 of 2 results.

A138474 Maximum possible magnitude of the x^n coefficient of a cyclotomic polynomial.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 4, 5, 4, 4, 4, 5, 5, 6, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 9, 9, 7, 8, 8, 10, 13, 12, 10, 12, 9, 11, 15, 13, 13, 14, 15, 13, 16, 15, 15, 14, 16, 24, 17, 21, 21, 16, 22, 28, 26, 23
Offset: 0

Views

Author

T. D. Noe, Mar 19 2008, Apr 14 2008, Feb 16 2009

Keywords

Comments

Terms for n <= 30 come from Table 1 of the Gallot et al. paper, which quotes results from Moller. Sequence A138475 gives the minimum order of the cyclotomic polynomial that produces that maximal coefficient. A very fast method (due to Grytczuk and Tropak) for computing the coefficients up to x^k in the cyclotomic polynomial Phi(n,x) is given by the Mathematica function coef[k,n] below.
The first n for which a(n) > n is 118. The sequence appears to be monotonic for n > 143. Terms up to n=128 were found by exhaustive search; subsequent terms were found by a much faster hill-climbing method.

Examples

			a(7)=2 is attained for the cyclotomic polynomial Phi(105,x), which has the term -2x^7.
		

References

  • A. Grytczuk and B. Tropak, A numerical method for the determination of the cyclotomic polynomial coefficients, Computational number theory (Debrecen, 1989), 15-19, de Gruyter, Berlin, 1991.

Crossrefs

Cf. A013594 (smallest order of cyclotomic polynomial containing n or -n as a coefficient).

Programs

  • Mathematica
    coef[k_,n_] := Module[{t, b=Table[0,{k+1}]}, t=-MoebiusMu[n]*Table[g=GCD[n,k-m]; MoebiusMu[g]*EulerPhi[g], {m,0,k-1}]; b[[1]]=1; Do[b[[j+1]] = Take[b,j].Take[t,-j]/j, {j,k}]; b]; Table[mx=1; r=PrimePi[k]+1; mnN=Prime[r]; ps=Reverse[Prime[Range[r]]]; Do[d=IntegerDigits[i,2,r]; n=Times@@Pick[ps,d,1]; c=Abs[coef[k,n][[ -1]]]; If[c==mx, mnN=Min[mnN,n], If[c>mx, mx=c; mnN=n]], {i,2^r-1}]; mx, {k,2,20}]

A140671 Numbers useful in computing A(k), the largest possible magnitude of the x^k coefficient in a cyclotomic polynomial.

Original entry on oeis.org

150, 820, 2751, 9298, 18016, 38907, 62286, 110681
Offset: 3

Views

Author

T. D. Noe, May 21 2008

Keywords

Comments

The values of A(k) are in sequence A138474. The least order N(k) of the cyclotomic polynomial producing A(k) is A138475(k). For k >= a(n), computational experiments have shown that only primes >= prime(n) divide N(k). These terms were determined empirically; is there another way of characterizing these numbers?
Showing 1-2 of 2 results.