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

 

Logo


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

%I

%S 4,2,3,10,2,17,13,13,2,27,18,36,36,47,26,3,64,29,36,64,17,11,2,43,36,

%T 36,36,36,70,62,100,64,144,144,64,144,100,100,144,64,144,144,36,36,

%U 196,130,29,36,36,100,64,144,256,144,144,64,64,100,36,144,269,13,36,36,324,63,256,144,36,100,196,196,144,100,100,196

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

%e a(1)=2^2 mod(5)=4 mod(5)=4.

%e a(2)=3^2 mod(7)=9 mod(7)=2.

%e a(3)=5^2 mod(11)=25 mod(11)=3.

%e a(4)=7^2 mod(13)=49 mod(13)=10.

%o (PARI) a(n) = prime(n)^2 % prime(n+2) \\ _Michel Marcus_, Aug 06 2013

%Y Cf. A167770 has a similar sequence generation rule.

%K nonn

%O 1,1

%A _Umut Uludag_, Jan 07 2011

%E General formula corrected by Umut Uludag

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 17 16:08 EST 2019. Contains 329241 sequences. (Running on oeis4.)