This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262208 a(n) = prime(n)^prime(n) mod n^n. 0

%I

%S 0,3,20,247,1861,28669,202564,12127115,115222124,6126483469,

%T 19465244918,4282552771669,4226847828547,3334905643119667,

%U 311202902635062863,13506468355090939237,455126377640041434982,3558300899222541879853

%N a(n) = prime(n)^prime(n) mod n^n.

%C Inspired by A262207.

%F a(n) = A051674(n) mod A000312(n).

%e For n = 2, a(n) = 27 mod 4 = 3.

%t Table[Mod[Prime[n]^Prime[n], n^n], {n, 18}] (* _Michael De Vlieger_, Sep 15 2015 *)

%o (PARI) a(n) = (prime(n)^prime(n)) % (n^n);

%o vector(20, n, a(n))

%o (MAGMA) [NthPrime(n)^NthPrime(n) mod n^n: n in [1..20]]; // _Vincenzo Librandi_, Sep 16 2015

%Y Cf. A262207, A051674, A000312, A004648.

%K nonn,easy

%O 1,2

%A _Altug Alkan_, Sep 15 2015

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.

Last modified October 18 07:35 EDT 2019. Contains 328146 sequences. (Running on oeis4.)