login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A262207
a(n) = prime(n)^n mod n^n.
1
0, 1, 17, 97, 1676, 21241, 214259, 5020449, 34808102, 7233300201, 46070142226, 7806783217105, 165239209697109, 1608006723911113, 48560388990668468, 4867006141797699265, 530779430908845468654, 18442832496573633213385
OFFSET
1,3
COMMENTS
Inspired by A002380, A067602, A138654.
a(3), a(4), a(7) and a(48) are prime numbers.
FORMULA
a(n) = A062457(n) mod A000312(n). - Michel Marcus, Sep 15 2015
EXAMPLE
For n = 1, a(n) = prime(1)^1 mod 1^1 = 2^1 mod 1 = 2 mod 1 = 0.
For n = 2, a(n) = prime(2)^2 mod 2^2 = 3^2 mod 4 = 9 mod 4 = 1.
For n = 3, a(n) = prime(3)^3 mod 3^3 = 5^3 mod 27 = 125 mod 27 = 17.
MATHEMATICA
Table[Mod[Prime[n]^n, n^n], {n, 18}] (* Michael De Vlieger, Sep 15 2015 *)
PROG
(PARI) a(n) = (prime(n)^n) % (n^n);
vector(18, n, a(n))
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Altug Alkan, Sep 15 2015
STATUS
approved