A179394 a(n) = prime(n)^2 mod prime(n+2).

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, 36, 36, 36, 70, 62, 100, 64, 144, 144, 64, 144, 100, 100, 144, 64, 144, 144, 36, 36, 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

Offset: 1

Author

Umut Uludag, Jan 07 2011

Keywords

• nonn

Examples

			a(1)=2^2 mod(5)=4 mod(5)=4.
a(2)=3^2 mod(7)=9 mod(7)=2.
a(3)=5^2 mod(11)=25 mod(11)=3.
a(4)=7^2 mod(13)=49 mod(13)=10.
		

Links

• Harvey P. Dale, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A167770 has a similar sequence generation rule.

Programs

Mathematica

PowerMod[#[[1]],2,#[[3]]]&/@Partition[Prime[Range[80]],3,1] (* Harvey P. Dale, May 30 2023 *)

PARI

a(n) = prime(n)^2 % prime(n+2) \\ Michel Marcus, Aug 06 2013

Extensions

General formula corrected by Umut Uludag