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 A047933 #19 Jul 02 2025 16:01:57
%S A047933 3,5,7,13,31,61,103,109,151,157,181,199,229,257,271,277,347,349,373,
%T A047933 421,463,661,739,823,829,977,997,1021,1031,1063,1093,1231,1279,1303,
%U A047933 1429,1453,1621,1669,1789,1879,1933,1951,1999,2029,2143,2239,2269,2311
%N A047933 Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of q.
%D A047933 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 864.
%H A047933 T. D. Noe, <a href="/A047933/b047933.txt">Table of n, a(n) for n=1..1000</a>
%H A047933 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%H A047933 <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a>
%e A047933 11 has primitive root 2 and 11+2 = 13 is prime after 11, so 13 is in sequence.
%t A047933 Total/@Select[{#,PrimitiveRoot[#]}&/@Prime[Range[400]],NextPrime[ First[#]] == Total[#]&] (* _Harvey P. Dale_, Feb 18 2011 *)
%Y A047933 Cf. A047934, A047935. See also A001918.
%K A047933 nice,nonn
%O A047933 1,1
%A A047933 _Felice Russo_
%E A047933 More terms from _James Sellers_, Dec 22 1999