

A189408


Least k where Phi(k) has height greater than k^n, where Phi(k) is the kth cyclotomic polynomial and the height is the largest absolute value of the coefficients.


0




OFFSET

1,1


COMMENTS

Arnold & Monagan compute this sequence to demonstrate their fast algorithm for computing cyclotomic polynomials.
This sequence is infinite because (the supremum of) A160338 grows exponentially.


LINKS

Andrew Arnold and Michael Monagan, A fast recursive algorithm for computing cyclotomic polynomials, ACM Commun. Comput. Algebra 44:3/4 (2010), pp. 8990. doi:10.1145/1940475.1940479


CROSSREFS



KEYWORD

nonn,hard,more


AUTHOR



STATUS

approved



