login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179397 a(n) = prime(n)^2 mod prime(n-2). 1
1, 1, 1, 1, 3, 10, 2, 5, 18, 6, 7, 36, 36, 14, 3, 11, 5, 39, 36, 64, 27, 21, 30, 55, 36, 36, 36, 36, 106, 98, 100, 64, 7, 5, 64, 144, 100, 100, 144, 64, 144, 144, 36, 36, 196, 178, 45, 36, 36, 100, 64, 144, 15, 144, 144, 64, 64, 100, 36, 144, 10, 31, 36, 36, 11, 83, 256, 144, 36, 100, 196, 196, 144, 100, 100, 196 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,5
LINKS
EXAMPLE
a(1) = 5^2 mod 2 = 25 mod 2 = 1;
a(2) = 7^2 mod 3 = 49 mod 3 = 1;
a(3) = 11^2 mod 5 = 121 mod 5 = 1;
a(4) = 13^2 mod 7 = 169 mod 7 = 1;
a(5) = 17^2 mod 11 = 289 mod 11 = 3.
MAPLE
A179397 := proc(n) ithprime(n)^2 mod ithprime(n-2); end proc: # R. J. Mathar, Jan 09 2011
MATHEMATICA
PowerMod[#[[3]], 2, #[[1]]]&/@Partition[Prime[Range[80]], 3, 1] (* Harvey P. Dale, Oct 21 2018 *)
CROSSREFS
Cf. A038702.
Sequence in context: A165590 A234935 A016450 * A111272 A124692 A091043
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)