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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022463 a(n) = prime(n^2) mod prime(n). 1
0, 1, 3, 4, 9, 8, 6, 7, 5, 19, 10, 13, 25, 32, 17, 29, 50, 8, 25, 43, 17, 64, 68, 28, 78, 1, 60, 15, 50, 104, 80, 39, 106, 28, 97, 57, 17, 150, 51, 5, 7, 78, 24, 149, 76, 153, 59, 100, 53, 94, 27, 220, 164, 218, 240, 126, 188, 58, 20, 174, 40, 178, 47, 309, 167, 114, 244, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Robert Israel, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A011757(n) modulo A000040(n). - Michel Marcus, Sep 30 2013

MAPLE

seq(ithprime(i^2) mod ithprime(i), i=1..1000); # Robert Israel, May 26 2014

MATHEMATICA

Table[Mod[Prime[n^2], Prime[n]], {n, 100}] (* Vincenzo Librandi, Dec 09 2014 *)

PROG

(PARI) a(n) = prime(n^2) % prime(n); \\ Michel Marcus, Sep 30 2013

(MAGMA) [NthPrime(n^2) mod NthPrime(n): n in [1..90]]; // Vincenzo Librandi, Dec 09 2014

CROSSREFS

Sequence in context: A167531 A062319 A178590 * A239384 A242219 A106833

Adjacent sequences:  A022460 A022461 A022462 * A022464 A022465 A022466

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 03:26 EST 2016. Contains 278745 sequences.