%I #102 Sep 05 2023 05:48:16
%S 1,1,2,2,1,2,1,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
%U 1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N 0, 1, or 2 primes at primorial(n) +- 1.
%C a(n) = 0 marks a prime gap size of at least 2*prime(n+1)-1, e.g., primorial(8) +- prime(9) = {9699667,9699713} are primes, gap 2*23-1.
%C Mathworld reports that it is not known if there are an infinite number of prime Euclid numbers.
%C The tables in Ondrejka's collection contain no further primorial twin primes after {2309,2311} = primorial(13) +- 1 up to primorial(15877) +- 1 with 6845 digits.
%D H. Dubner, A new primorial prime, J. Rec. Math., 21 (No. 4, 1989), 276.
%H Chris K. Caldwell, <a href="https://primes.utm.edu/top20/page.php?id=5">the top 20: Primorial</a>, 2012.
%H H. Dubner & N. J. A. Sloane, <a href="https://oeis.org/A002981/a002981.pdf">Correspondence, 1991,</a> on A005234.
%H G. L. Honaker, Jr. and Chris Caldwell, <a href="https://primes.utm.edu/curios/page.php?short=30029">Prime Curios! 30029</a>.
%H G. L. Honaker, Jr. and Chris Caldwell, <a href="https://primes.utm.edu/curios/page.php?short=9699667">Prime Curios! 9699667</a>.
%H Rudolf Ondrejka, <a href="https://primes.utm.edu/lists/top_ten/topten.pdf">The Top Ten: a Catalogue of Primal Configurations</a>, 2001, tables 20, 20A, 20B.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimorialPrime.html">Primorial Prime</a>.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EuclidNumber.html">Euclid Number</a>.
%F a(n) = [ isprime(primorial(n) - 1) ] + [ isprime(primorial(n) + 1) ].
%F a(n) = Sum_{i in {-1,1}} A010051(primorial(n) + i).
%e a(2) = a(3) = a(5) = 2: 2*3 +-1 = {5,7}, 6*5 +-1 = {29,31} and 210*11 +-1 = {2309,2311} are twin primes.
%e a(1) = a(4) = a(6) = 1: 1, 30*7 - 1 = 209 and 2310*13 + 1 = 30031 are not primes.
%e a(7) = 0: 510509 = 61 * 8369 and 510511 = 19 * 26869 are not primes.
%p p:= proc(n) option remember; `if`(n<1, 1, ithprime(n)*p(n-1)) end:
%p a:= n-> add(`if`(isprime(p(n)+i), 1, 0), i=[-1, 1]):
%p seq(a(n), n=0..120); # _Alois P. Heinz_, Mar 18 2020
%t primorial[n_] := primorial[n] = Times @@ Prime[Range[n]];
%t a[n_] := Boole@PrimeQ[primorial[n] - 1] + Boole@PrimeQ[primorial[n] + 1];
%t a /@ Range[0, 105] (* _Jean-François Alcover_, Nov 30 2020 *)
%o (Rexx)
%o S = '' ; Q = 1
%o do N = 1 to 27
%o Q = Q * PRIME( N )
%o T = ISPRIME( Q - 1 ) + ISPRIME( Q + 1 )
%o S = S || ',' T
%o end N
%o S = substr( S, 3 )
%o say S ; return S
%Y Cf. A096831, A002110 (primorials, p#), A057706.
%Y Cf. A006862 (Euclid, p#+1), A005234 (prime p#+1), A014545 (index prime p#+1).
%Y Cf. A057588 (Kummer, p#-1), A006794 (prime p#-1), A057704 (index prime p#-1).
%Y Cf. A010051, A088411 (where a(n) is positive), A088257.
%K nonn
%O 0,3
%A _Frank Ellermann_, Mar 06 2020