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

%I #9 Apr 22 2021 10:28:18

%S 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,

%T 67,28,103,98,87,112,95,140,7,68,42,156,82,76,68,91,14,64,157,42,49,

%U 191,77,133,57,109,139,61,105,135,128,152,164,229,149,107,120,166,47,116,165,188,286,200,326

%N a(n) = A081411(n) mod prime(n+1).

%C Do all positive integers appear in the sequence?

%H Robert Israel, <a href="/A343585/b343585.txt">Table of n, a(n) for n = 1..10000</a>

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

%p A081411[1]:= 1:

%p for n from 2 to 200 do

%p A081411[n]:= A081411[n-1]*(ithprime(n+1)-ithprime(n))

%p od:

%p seq(A081411[n] mod ithprime(n+1), n=1..200);

%Y Cf. A081411

%K nonn

%O 1,2

%A _J. M. Bergot_ and _Robert Israel_, Apr 20 2021