login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262208 a(n) = prime(n)^prime(n) mod n^n. 0
0, 3, 20, 247, 1861, 28669, 202564, 12127115, 115222124, 6126483469, 19465244918, 4282552771669, 4226847828547, 3334905643119667, 311202902635062863, 13506468355090939237, 455126377640041434982, 3558300899222541879853 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Inspired by A262207.
LINKS
FORMULA
a(n) = A051674(n) mod A000312(n).
EXAMPLE
For n = 2, a(n) = 27 mod 4 = 3.
MATHEMATICA
Table[Mod[Prime[n]^Prime[n], n^n], {n, 18}] (* Michael De Vlieger, Sep 15 2015 *)
PROG
(PARI) a(n) = (prime(n)^prime(n)) % (n^n);
vector(20, n, a(n))
(Magma) [NthPrime(n)^NthPrime(n) mod n^n: n in [1..20]]; // Vincenzo Librandi, Sep 16 2015
CROSSREFS
Sequence in context: A256018 A227469 A349928 * A324955 A183607 A331504
KEYWORD
nonn,easy
AUTHOR
Altug Alkan, Sep 15 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:22 EDT 2024. Contains 371268 sequences. (Running on oeis4.)