login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A189408 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. 0
1181895, 43730115, 416690995, 1880394945 (list; graph; refs; listen; history; text; internal format)
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. 89-90. doi:10.1145/1940475.1940479
Andrew Arnold, Michael Monagan, Calculating cyclotomic polynomials, Mathematics of Computation 80 (276) (2011) 2359-2379 preprint.
Andrew Arnold and Michael Monagan, Cyclotomic Polynomials
CROSSREFS
Subsequence of A160340. Cf. A160338, A108975.
Sequence in context: A210411 A204777 A236718 * A251988 A233469 A237849
KEYWORD
nonn,hard,more
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 04:59 EDT 2024. Contains 374377 sequences. (Running on oeis4.)