OFFSET
1,1
COMMENTS
LINKS
M. F. Hasler, Nov 10 2006, Table of n, a(n) for n = 1..199
MAPLE
A123855_mod := proc(n, p) option remember; local s, i, pi; s:=0: for i to n do pi:= ithprime(i) mod p: if pi=1 then s:=s+n mod p: else s := s+pi*(pi &^ n - 1)/(pi-1) mod p fi od end; A123856 := proc(n::posint) option remember; local p; if n>1 then p:=nextprime( procname(n-1)) else p:=2 fi: while A123855_mod(p-1, p)<>0 do p:=nextprime( p ) od: p end; # M. F. Hasler, Nov 10 2006
MATHEMATICA
fQ[p_] := Mod[ Sum[ PowerMod[ Prime@ i, j, p], {j, p - 1}, {i, p - 1}], p] == 0; Select[ Prime@ Range@ 117, fQ] (* Robert G. Wilson v, Jun 10 2011 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alexander Adamchuk, Oct 13 2006
STATUS
approved