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 A068488 #18 Feb 19 2024 15:23:49
%S A068488 2,4,11,47,344,17,8,69,66,67,8028643011,42,18,39,162,21,59,48,
%T A068488 2311331257,179,369,2477,23289,32,172011,75668,342,35,28757,356411,
%U A068488 243,297,152
%N A068488 m for which p(m) is the least prime dividing #p(n) + 1, i.e., primorial n-th prime augmented by 1 (A005234).
%C A068488 Since #P34 + 1 has two rather large factors, we need the number of primes less than or equal to 678279959005528882498681487.
%H A068488 R. Mestrovic, <a href="http://arxiv.org/abs/1202.3670">Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof</a>, arXiv preprint arXiv:1202.3670 [math.HO], 2012-2018. - From N. J. A. Sloane, Jun 13 2012
%H A068488 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha102.htm">Factorization results #Pn (Primorial) + 1</a>
%F A068488 a(n) = PrimePi(A051342).
%t A068488 Do[ Print[ PrimePi[ FactorInteger[ Product[ Prime[k], {k, 1, n}] + 1] [[1, 1]]]], {n, 1, 20} ]
%Y A068488 Cf. A068489.
%K A068488 nonn,hard,more
%O A068488 1,1
%A A068488 _Lekraj Beedassy_, Mar 11 2002
%E A068488 Edited and extended by _Robert G. Wilson v_, Mar 12 2002