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 A237838 #8 Feb 14 2014 03:30:41
%S A237838 0,1,3,2,3,2,2,2,2,1,1,2,3,2,1,1,1,1,1,1,2,1,3,3,2,3,2,1,2,1,2,1,2,3,
%T A237838 2,2,1,3,3,4,4,4,3,4,1,1,3,3,2,3,1,1,2,2,4,1,4,3,5,4,5,4,3,4,3,4,3,2,
%U A237838 1,4,3,4,6,1,3,3,3,4,2,3
%N A237838 a(n) = |{0 < k <= n: the number of Sophie Germain primes among 1, ..., k*n is a Sophie Germain prime}|.
%C A237838 Conjecture: a(n) > 0 for all n > 1.
%C A237838 See also A237839 for a similar conjecture involving twin primes.
%H A237838 Zhi-Wei Sun, <a href="/A237838/b237838.txt">Table of n, a(n) for n = 1..1000</a>
%e A237838 a(20) = 1 since 11 is a Sophie Germain prime, and there are exactly 11 Sophie Germain primes among 1, ..., 6*20 (namely, they are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113).
%t A237838 SG[n_]:=PrimeQ[n]&&PrimeQ[2n+1]
%t A237838 sg[n_]:=Sum[If[PrimeQ[2*Prime[k]+1],1,0],{k,1,PrimePi[n]}]
%t A237838 a[n_]:=Sum[If[SG[sg[k*n]],1,0],{k,1,n}]
%t A237838 Table[a[n],{n,1,80}]
%Y A237838 Cf. A005384, A237578, A237768, A237815, A237839.
%K A237838 nonn
%O A237838 1,3
%A A237838 _Zhi-Wei Sun_, Feb 14 2014