cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 21-22 of 22 results.

A114430 Primes of the form 1 + product of the first n 3-almost primes A014612.

Original entry on oeis.org

97, 32920473601, 1448500838401, 65182537728001, 1491301685600774317670400000001, 48235157779343672198731287466250036763794299837586774072944798728192000000000000000001
Offset: 1

Views

Author

Jonathan Vos Post, Feb 13 2006

Keywords

Comments

3-almost prime analog of primorial primes A005234 (primes p such that 1 + product of primes up to p is prime) as indexed by A014545 (n such that n-th Euclid number (A006862(n)) = 1 + (Product of first n primes) is prime). In that sense, this sequence is indexed by (2, 8, 9, 10, 19, ...).

Examples

			a(1) = 97 = 96 + 1 = 1 + (8 * 12) = 1 + A014612(1)*A014612(2) = 1 more than the product of the first 2 of the 3-almost primes and is prime.
a(2) = 32920473601 = 1 + (8 * 12 * 18 * 20 * 27 * 28 * 30 * 42) = 1 more than the product of the first 8 of the 3-almost primes and is prime.
a(3) = 1 more than the product of the first 9 of the 3-almost primes and is prime.
a(4) = 1 more than the product of the first 10 of the 3-almost primes and is prime.
a(5) = 1 more than the product of the first 19 of the 3-almost primes and is prime.
		

Crossrefs

Programs

  • Mathematica
    Select[Rest[FoldList[Times,1,Select[Range[250],PrimeOmega[#]==3&]]]+1,PrimeQ] (* Harvey P. Dale, Dec 21 2013 *)

Formula

{a(n)} = {1 + Prod[from i = 1 to n] A014612(i)} INTERSECTION {A000040}.

Extensions

One more term (a(6)) from Harvey P. Dale, Dec 21 2013

A333058 0, 1, or 2 primes at primorial(n) +- 1.

Original entry on oeis.org

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, 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, 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
Offset: 0

Views

Author

Frank Ellermann, Mar 06 2020

Keywords

Comments

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.
Mathworld reports that it is not known if there are an infinite number of prime Euclid numbers.
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.

Examples

			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.
a(1) = a(4) = a(6) = 1: 1, 30*7 - 1 = 209 and 2310*13 + 1 = 30031 are not primes.
a(7) = 0: 510509 = 61 * 8369 and 510511 = 19 * 26869 are not primes.
		

References

  • H. Dubner, A new primorial prime, J. Rec. Math., 21 (No. 4, 1989), 276.

Crossrefs

Cf. A096831, A002110 (primorials, p#), A057706.
Cf. A006862 (Euclid, p#+1), A005234 (prime p#+1), A014545 (index prime p#+1).
Cf. A057588 (Kummer, p#-1), A006794 (prime p#-1), A057704 (index prime p#-1).
Cf. A010051, A088411 (where a(n) is positive), A088257.

Programs

  • Maple
    p:= proc(n) option remember; `if`(n<1, 1, ithprime(n)*p(n-1)) end:
    a:= n-> add(`if`(isprime(p(n)+i), 1, 0), i=[-1, 1]):
    seq(a(n), n=0..120);  # Alois P. Heinz, Mar 18 2020
  • Mathematica
    primorial[n_] := primorial[n] = Times @@ Prime[Range[n]];
    a[n_] := Boole@PrimeQ[primorial[n] - 1] + Boole@PrimeQ[primorial[n] + 1];
    a /@ Range[0, 105] (* Jean-François Alcover, Nov 30 2020 *)
  • Rexx
    S = ''                     ;  Q = 1
    do N = 1 to 27
       Q = Q * PRIME( N )
       T = ISPRIME( Q - 1 ) + ISPRIME( Q + 1 )
       S = S || ',' T
    end N
    S = substr( S, 3 )
    say S                      ;  return S

Formula

a(n) = [ isprime(primorial(n) - 1) ] + [ isprime(primorial(n) + 1) ].
a(n) = Sum_{i in {-1,1}} A010051(primorial(n) + i).
Previous Showing 21-22 of 22 results.