login
This site is supported by donations 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

Table of n, a(n) for n=1..18.

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

Cf. A262207, A051674, A000312, A004648.

Sequence in context: A237652 A256018 A227469 * A324955 A183607 A197322

Adjacent sequences:  A262205 A262206 A262207 * A262209 A262210 A262211

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 06:38 EDT 2019. Contains 327090 sequences. (Running on oeis4.)