This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022460 a(n) = prime(3n) mod prime(n). 0
 1, 1, 3, 2, 3, 9, 5, 13, 11, 26, 13, 3, 3, 9, 9, 11, 56, 7, 1, 68, 15, 1, 15, 3, 88, 94, 7, 5, 13, 11, 106, 110, 112, 1, 124, 140, 136, 130, 142, 140, 140, 158, 154, 164, 170, 190, 178, 158, 172, 176, 184, 194, 214, 200, 206, 208, 212, 220, 220, 226, 244 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS FORMULA a(n) = A031336(n) modulo A000040(n). - Michel Marcus, Sep 30 2013 MATHEMATICA Table[Mod[Prime[3 n], Prime[n]], {n, 100}] (* Vincenzo Librandi, Dec 09 2014 *) PROG (PARI) a(n) = prime(3*n) % prime(n); \\ Michel Marcus, Sep 30 2013 (MAGMA) [NthPrime(3*n) mod NthPrime(n): n in [1..90]]; // Vincenzo Librandi, Dec 09 2014 CROSSREFS Sequence in context: A191628 A261999 A216829 * A010605 A120879 A118064 Adjacent sequences:  A022457 A022458 A022459 * A022461 A022462 A022463 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.