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

 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: A285265 A330385 A178590 * A239384 A242219 A106833 Adjacent sequences: A022460 A022461 A022462 * A022464 A022465 A022466 KEYWORD nonn AUTHOR 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.

Last modified March 28 23:19 EDT 2023. Contains 361596 sequences. (Running on oeis4.)