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!)
A179395 a(n) = prime(n)^2 mod prime(n+3). 1

%I #15 Jan 06 2019 04:54:30

%S 4,9,12,15,7,8,28,20,11,21,15,6,38,20,13,62,2,71,65,61,78,33,21,93,

%T 100,64,100,19,91,28,5,26,45,10,33,89,83,77,15,133,3,59,64,113,7,103,

%U 95,100,144,144,73,67,221,55,196,196,144,144,256,62,162,87,100,69,239,206,324,256,144,324,27,21,256,256,324

%N a(n) = prime(n)^2 mod prime(n+3).

%e a(1) = 2^2 mod 7 = 4 mod 7 = 4;

%e a(2) = 3^2 mod 11 = 9 mod 11 = 9;

%e a(3) = 5^2 mod 13 = 25 mod 13 = 12;

%e a(4) = 7^2 mod 17 = 49 mod 17 = 15.

%p A179395 := proc(n) ithprime(n)^2 mod ithprime(n+3); end proc: # _R. J. Mathar_, Jan 09 2011

%t Table[Mod[Prime[n]^2,Prime[n+3]],{n,100}] (* _Harvey P. Dale_, Jan 21 2011 *)

%Y Cf. A167770.

%K nonn

%O 1,1

%A _Umut Uludag_, Jan 07 2011

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 April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)