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.
%I A189408 #13 May 10 2025 09:18:23 %S A189408 1181895,43730115,416690995,1880394945 %N 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. %C A189408 Arnold & Monagan compute this sequence to demonstrate their fast algorithm for computing cyclotomic polynomials. %C A189408 This sequence is infinite because (the supremum of) A160338 grows exponentially. %H A189408 Andrew Arnold and Michael Monagan, <a href="https://wayback.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 A189408 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 A189408 Andrew Arnold and 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="https://wayback.cecm.sfu.ca/~ada26/cyclotomic/PDFs/CalcCycloPolysApr2010.pdf">preprint</a>. %H A189408 Andrew Arnold and Michael Monagan, <a href="https://wayback.cecm.sfu.ca/~ada26/cyclotomic/">Cyclotomic Polynomials</a> %Y A189408 Subsequence of A160340. Cf. A160338, A108975. %K A189408 nonn,hard,more %O A189408 1,1 %A A189408 _Charles R Greathouse IV_, Apr 21 2011