OFFSET
1,1
COMMENTS
A007519(n) : primes of form 8n+1.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Jorma K. Merikoski, Pentti Haukkanen, and Timo Tossavainen, The congruence x^n = -a^n (mod m): Solvability and related OEIS sequences, Notes. Num. Theor. Disc. Math. (2024) Vol. 30, No. 3, 516-529. See p. 521.
EXAMPLE
a(5) = 33 because 33^4+1 = 1185922 = 2 * 97 * 6113 with A007519(5) = 97.
MAPLE
V:= Vector(100): count:= 0:
for p from 9 by 8 while count < 100 do
if isprime(p) then
count:= count+1; V[count]:=min(map(rhs@op, [msolve(k^4+1, p)]))
fi
od:
convert(V, list); # Robert Israel, Mar 13 2018
MATHEMATICA
aa = {}; Do[p = Prime[n]; If[Mod[p, 8] == 1, k = 1; While[ ! Mod[k^4 + 1, p] == 0, k++ ]; AppendTo[aa, k]], {n, 300}]; aa
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Oct 22 2012
STATUS
approved