|
| |
|
|
A038702
|
|
prime(n)^2 mod prime(n-1).
|
|
14
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 2,3
|
|
|
EXAMPLE
| To get the 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.
|
|
|
MATHEMATICA
| Table[Mod[Prime[n+1]^2, Prime[n]], {n, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 26 2010]
|
|
|
CROSSREFS
| Cf. A038703.
Sequence in context: A056158 A010316 A083954 * A085062 A053051 A075234
Adjacent sequences: A038699 A038700 A038701 * A038703 A038704 A038705
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. Fernandez (primeness(AT)borve.org), May 01 2000
|
| |
|
|
