login
This site is supported by donations 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
4, 9, 12, 15, 7, 8, 28, 20, 11, 21, 15, 6, 38, 20, 13, 62, 2, 71, 65, 61, 78, 33, 21, 93, 100, 64, 100, 19, 91, 28, 5, 26, 45, 10, 33, 89, 83, 77, 15, 133, 3, 59, 64, 113, 7, 103, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..75.

EXAMPLE

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

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

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

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

MAPLE

A179395 := proc(n) ithprime(n)^2 mod ithprime(n+3); end proc: # R. J. Mathar, Jan 09 2011

MATHEMATICA

Table[Mod[Prime[n]^2, Prime[n+3]], {n, 100}]  (* Harvey P. Dale, Jan 21 2011 *)

CROSSREFS

Cf. A167770.

Sequence in context: A140399 A312849 A161544 * A175251 A287367 A312850

Adjacent sequences:  A179392 A179393 A179394 * A179396 A179397 A179398

KEYWORD

nonn

AUTHOR

Umut Uludag, Jan 07 2011

STATUS

approved

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 October 21 04:40 EDT 2019. Contains 328291 sequences. (Running on oeis4.)