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 high-performance algorithm for calculating cyclotomic polynomials, PASCO 2010. doi:10.1145/1837210.1837228
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
KEYWORD
nonn,hard,more
AUTHOR
Charles R Greathouse IV, Apr 21 2011
STATUS
approved