The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022462 a(n) = prime(n)*prime(n+2) mod prime(n+1). 4
 1, 1, 6, 3, 5, 9, 11, 22, 17, 19, 13, 33, 35, 23, 17, 47, 49, 43, 63, 61, 55, 59, 41, 65, 93, 95, 99, 101, 57, 71, 107, 125, 119, 129, 139, 121, 139, 143, 137, 167, 161, 171, 185, 189, 175, 67, 175, 219, 221, 209, 227, 221, 191, 221, 227, 257, 259, 253, 273, 263 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A090076(n) modulo A000040(n+1). - Michel Marcus, Sep 30 2013 MATHEMATICA Table[Mod[Prime[n]Prime[n+2], Prime[n+1]], {n, 1, 50}] (* G. C. Greubel, Feb 28 2018 *) PROG (PARI) a(n) = (prime(n)*prime(n+2)) % prime(n+1); \\ Michel Marcus, Sep 30 2013 (MAGMA) [NthPrime(n)*NthPrime(n+2) mod NthPrime(n+1): n in [1..50]]; // G. C. Greubel, Feb 28 2018 CROSSREFS Cf. A090076, A073271, A000040. Sequence in context: A296501 A296491 A085653 * A319894 A241786 A019151 Adjacent sequences:  A022459 A022460 A022461 * A022463 A022464 A022465 KEYWORD nonn AUTHOR EXTENSIONS Edited by Reinhard Zumkeller, Jul 22 2002 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.

Last modified May 28 17:37 EDT 2020. Contains 334684 sequences. (Running on oeis4.)