OFFSET
1,1
COMMENTS
Original name was: a(n) = the least number k such that cos(2pi/k) is an algebraic number of a prime(n)-smooth degree, but not prime(n-1)-smooth.
Comments from N. J. A. Sloane, Jan 07 2013: (Start)
This is a duplicate of A066674. This follows from the following argument. The degree of the minimal polynomial of cos(2*Pi/k) is phi(k)/2, where phi is Euler's totient function. Then a(n) is the least number k such that prime(n) is the largest prime dividing phi(k) and prime(n-1) does not divide phi(k)/2. For the rest of the proof see Bjorn Poonen's remarks in A066674.
It also seems likely that this is the same as A035095, but this is an open problem.
Conjecture: this sequence contains only primes (this would follow if this is indeed the same as A035095).
(End)
REFERENCES
See A181877.
CROSSREFS
KEYWORD
dead
AUTHOR
Artur Jasinski, Dec 13 2006
EXTENSIONS
Edited by Don Reble, Apr 24 2007
Minor edits by Ray Chandler, Oct 20 2011
STATUS
approved