OFFSET
0,1
COMMENTS
LINKS
R. Ernvall and T. Metsänkylä, Cyclotomic invariants and E-irregular primes, Mathematics of Computation 32 (1978), 617-629.
PROG
(PARI) a000364(n) = subst(bernpol(2*n+1), 'x, 1/4)*4^(2*n+1)*(-1)^(n+1)/(2*n+1) \\ after Charles R Greathouse IV in A000364
a308243(n) = my(p=prime(n), e=2, i=0); while(e <= p-3, if(a000364(e)%p==0, i++); e=e+2); i
a(n) = for(x=1, oo, if(a308243(x)==n, return(prime(x))))
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Felix Fröhlich, May 17 2019
STATUS
approved