OFFSET
1,1
COMMENTS
n = 9069 * 2^64163 + 1 is an example of a rather large member of this sequence. The generated 115914 decimal digit prime is proved by the N-1 method (because n is prime and n*(n-1) is fully factored and this provides for an exactly 33.33...% factorization for Phi_14(n) - 1). - Serge Batalov, Mar 13 2015
LINKS
Serge Batalov, Table of n, a(n) for n = 1..1595
EXAMPLE
2 is in the sequence because 2^6-2^5+2^4-2^3+2^2-2+1 = 43 which is prime.
MATHEMATICA
a250174[n_] := Select[Range[n], PrimeQ@Cyclotomic[14, #] &]; a250174[256]
PROG
(PARI) isok(n) = isprime(polcyclo(14, n)); \\ Michel Marcus, Mar 13 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric Chen, Dec 24 2014
STATUS
approved