The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A099936 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A099936

Primes of the form 1 + product of first n prime gaps.
(history; published version)

#9 by Harvey P. Dale at Sat Jan 02 15:18:10 EST 2021

STATUS

editing

approved

#8 by Harvey P. Dale at Sat Jan 02 15:18:07 EST 2021

LINKS

Harvey P. Dale, <a href="/A099936/b099936.txt">Table of n, a(n) for n = 1..25</a>

STATUS

approved

editing

#7 by Harvey P. Dale at Sat Jan 02 15:15:20 EST 2021

STATUS

editing

approved

#6 by Harvey P. Dale at Sat Jan 02 15:15:17 EST 2021

MATHEMATICA

Select[FoldList[Times, Differences[Prime[Range[100]]]]+1, PrimeQ] (* Harvey P. Dale, Jan 02 2021 *)

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 17:34:14 EDT 2012

AUTHOR

_Roger L. Bagula (rlbagulatftn(AT)yahoo.com), _, Nov 12 2004

Discussion

Fri Mar 30

17:34

OEIS Server: https://oeis.org/edit/global/158

#4 by Russ Cox at Fri Mar 30 17:27:43 EDT 2012

EXTENSIONS

Edited by _Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), _, Nov 15 2004

Discussion

Fri Mar 30

17:27

OEIS Server: https://oeis.org/edit/global/145

#3 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006

MATHEMATICA

w[n_]=Prime[n+1]-Prime[n] p[n_]=1+Product[w[m], {m, 2, n}] digits=60 a=Delete[Union[Table[If[PrimeQ[p[n]]==True, p[n], 0], {n, 1, digits}]], 1]

KEYWORD

nonn,easy,new

#2 by N. J. A. Sloane at Sat Apr 09 03:00:00 EDT 2005

KEYWORD

nonn,easy,new

AUTHOR

Roger L. Bagula (tftnrlbagulatftn(AT)earthlinkyahoo.netcom), Nov 12 2004

#1 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005

NAME

Primes of the form 1 + product of first n prime gaps.

DATA

2, 3, 5, 17, 257, 12289, 14155777, 169869313, 4076863489, 32318253138475745281, 12806790724213976503626296721408001, 307362977381135436087031121313792001

OFFSET

1,1

MATHEMATICA

w[n_]=Prime[n+1]-Prime[n] p[n_]=1+Product[w[m], {m, 2, n}] digits=60 a=Delete[Union[Table[If[PrimeQ[p[n]]==True, p[n], 0], {n, 1, digits}]], 1]

PROG

(PARI) for(n=1, 60, if(isprime(p=prod(m=1, n, prime(m+1)-prime(m))+1), print1(p, ", ")))

KEYWORD

nonn,easy

AUTHOR

Roger L. Bagula (tftn(AT)earthlink.net), Nov 12 2004

EXTENSIONS

Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 15 2004

STATUS

approved