OFFSET
1,1
COMMENTS
Odd primes p such that -1 is a 256th power mod p. - Eric M. Schmidt, Mar 27 2014
REFERENCES
M. Kraitchik, Theorie des Nombres, Gauthier-Villars (I. 1922, II. 1929).
M. Kraitchik, Recherches sur la theorie des nombres, Gauthier-Villars (1924).
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
a(n) ~ 256n log n. - Charles R Greathouse IV, Nov 01 2022
EXAMPLE
MATHEMATICA
Select[512 Range[164] + 1, PrimeQ] (* Bruno Berselli, Feb 23 2012 *)
PROG
(Haskell)
a076339 n = a076339_list !! (n-1)
a076339_list = filter ((== 1) . a010051) [1, 513..]
-- Reinhard Zumkeller, Mar 06 2012
(PARI) forprimestep(p=7681, 83969, 512, print1(p", ")) \\ Charles R Greathouse IV, Nov 01 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Oct 07 2002
STATUS
approved