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.
%I A100465 #12 Feb 06 2021 21:42:43 %S A100465 7,271,307,673 %N 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). %C A100465 No other terms for p < 80000000. %e A100465 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 %Y A100465 See A066735 for further information. %Y A100465 Cf. A006862 Euclid numbers. %K A100465 nonn,more %O A100465 1,1 %A A100465 Lévai Gábor (gablevai(AT)vipmail.hu), Nov 23 2004 %E A100465 a(2) corrected by _Martin Ehrenstein_, Feb 05 2021