OFFSET
1,1
COMMENTS
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
GCD of prime-exponents in canonical factorization of n is prime.
EXAMPLE
All 2-,3-,5-,7th ... powers are here, 4-,6-,8th etc. powers are excluded
from A001597.
MATHEMATICA
ffi[x_] :=Flatten[FactorInteger[x]] ep[x_] :=Table[Part[ffi[x], 2*w], {w, 1, lf[x]}] lf[x_] :=Length[FactorInteger[x]] Do[If[PrimeQ[Apply[GCD, ep[n]]], Print[n]], {n, 2, 10000}]
PROG
(Haskell)
a093771 n = a093771_list !! (n-1)
a093771_list = [a001597 x | x <- [2..], a010051 (a025479 x) == 1]
-- Reinhard Zumkeller, Mar 28 2014
(PARI) is(n)=isprime(ispower(n)) \\ Charles R Greathouse IV, Oct 19 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Apr 19 2004
STATUS
approved