A022461 a(n) = prime(n+1)*prime(n+2) mod prime(n).

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

Offset: 1

Author

Clark Kimberling

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A006094, A072565.

Programs

Magma

[NthPrime(n+1)*NthPrime(n+2) mod NthPrime(n): n in [1..50]]; // G. C. Greubel, Feb 27 2018

Mathematica

Table[Mod[Prime[n + 1]Prime[n + 2], Prime[n]], {n, 1, 80}] (* Stefan Steinerberger, Apr 14 2006 *)
Mod[#[[2]]#[[3]],#[[1]]]&/@Partition[Prime[Range[70]],3,1] (* Harvey P. Dale, Jun 05 2023 *)

PARI

for(n=1,50, print1((prime(n+1)*prime(n+2)) % prime(n), ", ")) \\ G. C. Greubel, Feb 27 2018

Formula

a(n) = A006094(n+1) mod A000040(n). - Michel Marcus, Feb 28 2018