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 A164962 #6 Dec 16 2018 08:41:23
%S A164962 2,3,2,3,2,13,3,19,2,13,31,3,19,43,2,53,13,61,31,71,73,3,19,43,2,101,
%T A164962 103,53,109,113,13,131,31
%N A164962 a(n) is the least prime from the union {2,3} and A164333, beginning with which the n-th prime p_n is obtained by some number of iterations of the S operator g(see A164960).
%C A164962 The sequence is connected with our sieve selecting the primes of the union {2,3} and A164333 from all primes. Note that a(n)=n iff p_n is in the considered union, which corresponds to 0's iterations of g.
%H A164962 V. Shevelev, <a href="https://arxiv.org/abs/0908.2319">On critical small intervals containing primes</a>, arXiv:0908.2319 [math.NT], 2009.
%Y A164962 Cf. A164333, A055496, A164960, A104272, A080359, A164918, A006992, A164917, A164368, A164288.
%K A164962 nonn,more,uned
%O A164962 1,1
%A A164962 _Vladimir Shevelev_, Sep 02 2009