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!)
 A022461 a(n) = prime(n+1)*prime(n+2) mod prime(n). 4
 1, 2, 2, 3, 1, 11, 12, 2, 2, 16, 29, 24, 12, 40, 25, 48, 16, 60, 24, 16, 60, 40, 1, 7, 24, 12, 24, 12, 72, 26, 40, 48, 24, 120, 16, 72, 60, 40, 72, 48, 24, 120, 12, 24, 28, 89, 192, 24, 12, 40, 48, 24, 160, 72, 72, 48, 16, 60, 24, 24, 240, 252, 24, 12, 72, 280 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A006094(n+1) mod A000040(n). - Michel Marcus, Feb 28 2018 MATHEMATICA Table[Mod[Prime[n + 1]Prime[n + 2], Prime[n]], {n, 1, 80}] (* Stefan Steinerberger, Apr 14 2006 *) PROG (PARI) for(n=1, 50, print1((prime(n+1)*prime(n+2)) % prime(n), ", ")) \\ G. C. Greubel, Feb 27 2018 (MAGMA) [NthPrime(n+1)*NthPrime(n+2) mod NthPrime(n): n in [1..50]]; // G. C. Greubel, Feb 27 2018 CROSSREFS Cf. A006094, A072565. Sequence in context: A220349 A273218 A173160 * A306821 A271226 A292372 Adjacent sequences:  A022458 A022459 A022460 * A022462 A022463 A022464 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 19 17:12 EDT 2021. Contains 343117 sequences. (Running on oeis4.)