A343585 a(n) = A081411(n) mod prime(n+1).

1, 2, 4, 5, 6, 9, 9, 12, 25, 12, 24, 40, 36, 37, 6, 26, 50, 13, 36, 6, 19, 69, 31, 12, 75, 45, 67, 28, 103, 98, 87, 112, 95, 140, 7, 68, 42, 156, 82, 76, 68, 91, 14, 64, 157, 42, 49, 191, 77, 133, 57, 109, 139, 61, 105, 135, 128, 152, 164, 229, 149, 107, 120, 166, 47, 116, 165, 188, 286, 200, 326

Offset: 1

Author

J. M. Bergot and Robert Israel, Apr 20 2021

Keywords

• nonn

Comments

Do all positive integers appear in the sequence?

Examples

			For n=4, a(4) = (3-2)*(5-3)*(7-5)*(11-7) mod 11 = 5.
		

Links

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A081411

Programs

Maple

A081411[1]:= 1:
for n from 2 to 200 do
  A081411[n]:= A081411[n-1]*(ithprime(n+1)-ithprime(n))
od:
seq(A081411[n] mod ithprime(n+1), n=1..200);