login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179398 a(n) = prime(n)^2 mod prime(n-3). 1

%I

%S 1,1,4,2,9,9,8,11,12,28,20,26,21,41,8,37,26,22,10,2,37,8,75,18,3,64,

%T 100,79,48,11,17,62,59,46,47,105,99,93,29,151,17,75,64,131,85,187,113,

%U 100,144,144,91,85,2,73,196,196,144,144,256,114,218,107,100,89,263,266,324,256,144,324,47,41,256,256,324

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

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

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

%e a(3) = 13^2 mod 5 = 169 mod 5 = 4;

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

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

%t Table[PowerMod[Prime[n],2,Prime[n-3]],{n,4,80}] (* _Harvey P. Dale_, Dec 13 2011 *)

%Y Cf. A038702.

%K nonn

%O 4,3

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 17:34 EST 2019. Contains 329106 sequences. (Running on oeis4.)