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.

A093077 Primes p = prime(i) such that p(i)# + p(i+1) is prime.

Original entry on oeis.org

2, 3, 5, 13, 17, 19, 43, 53, 59, 73, 367, 6143
Offset: 1

Views

Author

Robert G. Wilson v, Oct 25 2003

Keywords

Comments

Prime(A035346(n)) = a(n). - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 19 2004

Examples

			3 = p(2) is in the sequence because p(2)# + p(3) = 11 is prime.
		

Crossrefs

Programs

  • Mathematica
    Do[p = Product[ Prime[i], {i, 1, n}]; q = Prime[n + 1]; If[ PrimeQ[p + q], Print[ Prime[n]]], {n, 1, 1435}]
    With[{nn=1000},NextPrime[#,-1]&/@(Select[Thread[{FoldList[ Times,Prime[ Range[nn]]],Prime[Range[ 2,nn+1]]}], PrimeQ[ Total[#]]&][[All,2]])] (* Harvey P. Dale, Oct 07 2018 *)