|
|
A038702
|
|
Prime(n)^2 mod prime(n-1).
|
|
16
|
|
|
1, 1, 4, 2, 4, 3, 4, 16, 13, 4, 5, 16, 4, 16, 36, 36, 4, 36, 16, 4, 36, 16, 36, 64, 16, 4, 16, 4, 16, 83, 16, 36, 4, 100, 4, 36, 36, 16, 36, 36, 4, 100, 4, 16, 4, 144, 144, 16, 4, 16, 36, 4, 100, 36, 36, 36, 4, 36, 16, 4, 100, 196, 16, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
To get a(4): square the fourth prime to get 7^2 = 49. The remainder when this is divided by the third prime, 5, is 4. So a(3) = 4.
|
|
MAPLE
|
modp( ithprime(n)^2, ithprime(n-1)) ;
|
|
MATHEMATICA
|
Table[PowerMod[Prime[n], 2, Prime[n-1]], {n, 2, 70}] (* Harvey P. Dale, Mar 22 2012 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|