The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Sep 03 2014 19:33:30
%S 1181895,43730115,416690995,1880394945
%N Least k where Phi(k) has height greater than k^n, where Phi(k) is the k-th cyclotomic polynomial and the height is the largest absolute value of the coefficients.
%C Arnold & Monagan compute this sequence to demonstrate their fast algorithm for computing cyclotomic polynomials.
%C This sequence is infinite because (the supremum of) A160338 grows exponentially.
%H Andrew Arnold and Michael Monagan, <a href="http://www.cecm.sfu.ca/~ada26/cyclotomic/PDFs/highperf.pdf">A high-performance algorithm for calculating cyclotomic polynomials</a>, PASCO 2010. <a href="http://dx.doi.org/10.1145/1837210.1837228">doi:10.1145/1837210.1837228</a>
%H Andrew Arnold and Michael Monagan, A fast recursive algorithm for computing cyclotomic polynomials, ACM Commun. Comput. Algebra 44:3/4 (2010), pp. 89-90. <a href="http://dx.doi.org/10.1145/1940475.1940479">doi:10.1145/1940475.1940479</a>
%H Andrew Arnold, Michael Monagan, <a href="http://dx.doi.org/10.1090/S0025-5718-2011-02467-1">Calculating cyclotomic polynomials</a>, Mathematics of Computation 80 (276) (2011) 2359-2379 <a href="http://www.cecm.sfu.ca/~ada26/cyclotomic/PDFs/CalcCycloPolysApr2010.pdf">preprint</a>.
%H Andrew Arnold and Michael Monagan, <a href="http://www.cecm.sfu.ca/~ada26/cyclotomic/">Cyclotomic Polynomials</a>
%Y Subsequence of A160340. Cf. A160338, A108975.
%K nonn,hard,more
%O 1,1
%A _Charles R Greathouse IV_, Apr 21 2011