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 A047935 #18 Jul 02 2025 16:01:57
%S A047935 1,2,2,2,2,2,2,2,2,6,2,2,2,6,2,6,10,2,6,2,2,2,6,2,2,6,6,2,10,2,2,2,2,
%T A047935 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,6,6,2,6,2,6,6,2,6,2,2,2,2,2,2,2,2,2,
%U A047935 2,2,6,2,2,10,2,2,2,2,6,2,6,2,2,2,2,6,2,2,2,2,10,6,10,2,2,2,10,2,2,2,6,10
%N A047935 Consider primes p with least positive primitive root g such that q=p+g is next prime after p; sequence gives values of g.
%D A047935 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 A047935 T. D. Noe, <a href="/A047935/b047935.txt">Table of n, a(n) for n=1..1000</a>
%H A047935 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 A047935 <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a>
%e A047935 11 has primitive root 2 and 11+2 = 13 is prime after 11, which contributes a 2 to the sequence.
%t A047935 f[p_] := {g = PrimitiveRoot[p], p + g == NextPrime[p]};
%t A047935 A047935 = Select[f /@ Prime /@ Range[1000], #[[2]]& ][[All, 1]](* _Jean-François Alcover_, Feb 15 2012 *)
%Y A047935 Cf. A047933, A047934. See also A001918.
%K A047935 nice,nonn
%O A047935 1,2
%A A047935 _Felice Russo_
%E A047935 More terms from _James Sellers_, Dec 22 1999