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 A146757 #13 Jun 22 2019 10:51:47
%S A146757 2,15,68,363,2084,13567,95164,705036,5444255,43211106,351904307,
%T A146757 2921904565
%N A146757 Number of primes p < 10^n such that s - p is prime, where s is the next square greater than p.
%C A146757 The number of primes p in the range 2 <= p <= 10^n for which The distance to the next larger square (A068527(p)) is also a prime. - R. J. Mathar, Sep 26 2011
%e A146757 A(2) = 15 because at 10^2 there are 15 primes that, subtracted from the next higher value square, produce prime differences: {2, 7, 11, 13, 23, 29, 31, 47, 53, 59, 61, 79, 83, 89, 97}.
%t A146757 Table[Length[Select[Prime[Range[PrimePi[10^n]]], PrimeQ[Ceiling[Sqrt[#]]^2 - #] &]], {n, 6}] (* _T. D. Noe_, Mar 31 2013 *)
%o A146757 (UBASIC) 10 'sq less pr are prime 20 N=1:O=1:C=1 30 A=3:S=sqrt(N):if N>10^3 then print N,C-1:stop 40 B=N\A 50 if B*A=N then 100 60 A=A+2 70 if A<=S then 40 80 R=O^2:Q=R-N 90 if N<R and N=prmdiv(N) and Q=prmdiv(Q) then if Q>1 print R;N;Q;C:N=N+2:C=C+1:goto 30 100 N=N+2:if N<R then 30:else O=O+1:goto 80
%Y A146757 Cf. A146315, A146758, A146759, A146760.
%K A146757 more,nonn
%O A146757 1,1
%A A146757 _Enoch Haga_, Nov 02 2008
%E A146757 Name clarified by _T. D. Noe_, Mar 31 2013
%E A146757 a(8)-a(12) from _Chai Wah Wu_, Jun 22 2019