A179396 a(n) = prime(n)^2 modulo prime(n+4).

4, 9, 8, 11, 6, 24, 10, 28, 37, 24, 21, 44, 29, 19, 65, 40, 50, 8, 7, 57, 91, 80, 91, 3, 35, 31, 68, 52, 99, 120, 37, 98, 86, 87, 157, 138, 126, 143, 3, 14, 127, 125, 189, 8, 219, 213, 18, 17, 196, 233, 62, 50, 246, 129, 123, 43, 196, 191, 286, 278, 274, 259, 245, 2, 115, 326, 131, 125, 33, 203, 297, 193, 95, 179

Offset: 1

Author

Umut Uludag, Jan 07 2011

Keywords

• nonn
• easy

Examples

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

Crossrefs

Cf. A167770.

Programs

PARI

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

Formula

a(n) = A001248(n) mod A000040(n+4).