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.

A236465 Smallest prime a(n) such that 1 + a(1)*a(2)*...*a(n) is prime.

Original entry on oeis.org

2, 2, 3, 3, 2, 13, 2, 11, 19, 2, 2, 5, 11, 2, 31, 53, 3, 31, 43, 19, 13, 11, 43, 23, 7, 5, 13, 5, 29, 2, 29, 17, 53, 157, 13, 13, 3, 5, 127, 7, 97, 5, 97, 2, 89, 61, 7, 71, 61, 5, 127, 113, 37, 191, 107, 17, 197, 37, 101, 2, 5, 7, 17, 457, 3, 19, 29, 103, 227
Offset: 1

Views

Author

Thomas Ordowski, Jan 26 2014

Keywords

Examples

			a(1) = 2 because 1 + 2 = 3, which is prime.
a(2) = 2 because 1 + 2 * 2 = 5, which is prime.
a(3) = 3 because 2 doesn't work, since 1 + 2 * 2 * 2 = 9 = 3^2, but 3 does work, giving 1 + 2 * 2 * 3 = 13, which is prime.
		

Crossrefs

Programs

  • Mathematica
    pr = 1; Table[p = 2; While[! PrimeQ[p * pr + 1], p = NextPrime@p]; pr *= p; p, {n, 100}] (* Giovanni Resta, Jan 26 2014 *)

Extensions

a(11)-a(69) from Giovanni Resta, Jan 26 2014