|
|
A245478
|
|
Numbers k such that the k-th cyclotomic polynomial has a root mod 5.
|
|
6
|
|
|
1, 2, 4, 5, 10, 20, 25, 50, 100, 125, 250, 500, 625, 1250, 2500, 3125, 6250, 12500, 15625, 31250, 62500, 78125, 156250, 312500, 390625, 781250, 1562500, 1953125, 3906250, 7812500, 9765625, 19531250, 39062500, 48828125, 97656250, 195312500, 244140625, 488281250
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Numbers of the form 2^i * 5^j for 0 <= i <= 2 and j >= 0.
|
|
REFERENCES
|
Trygve Nagell, Introduction to Number Theory. New York: Wiley, 1951, pp. 164-168.
|
|
LINKS
|
|
|
FORMULA
|
a(3j + i) = 2^(i-1)*5^j for i = 1,2,3 and j >= 0.
a(n) = 5*a(n-3). G.f.: -x*(4*x^2+2*x+1) / (5*x^3-1). - Colin Barker, Aug 01 2014
|
|
EXAMPLE
|
The 4th cyclotomic polynomial x^2 + 1 considered modulo 5 has a root x = 2, so 4 is in the sequence.
|
|
PROG
|
(Sage) def A245478(n) : return 2^((n-1)%3)*5^((n-1)//3)
(PARI) for(n=1, 10^6, if(#polrootsmod(polcyclo(n), 5), print1(n, ", "))) /* by definition; rather inefficient. - Joerg Arndt, Jul 28 2014 */
(PARI) Vec(-x*(4*x^2+2*x+1)/(5*x^3-1) + O(x^100)) \\ Colin Barker, Aug 01 2014
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|