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.

A100465 Let p(1)=2, p(2)=3, p(3)=5, ... denote the primes and let E(n) = 1 + p(1) * p(2) * ... * p(n). Sequence gives primes p such that p(n+2) | E(n).

Original entry on oeis.org

7, 271, 307, 673
Offset: 1

Views

Author

Lévai Gábor (gablevai(AT)vipmail.hu), Nov 23 2004

Keywords

Comments

No other terms for p < 80000000.

Examples

			7 is a term of the sequence, because it is the 4th prime and divides E(2)=2*3+1=7 trivially. - _Martin Ehrenstein_, Feb 05 2021
		

Crossrefs

See A066735 for further information.
Cf. A006862 Euclid numbers.

Extensions

a(2) corrected by Martin Ehrenstein, Feb 05 2021