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 A263001 #11 Oct 08 2015 04:25:56
%S A263001 1,0,2,1,3,1,3,2,3,3,3,4,3,4,2,5,4,2,7,2,4,5,2,7,2,5,4,4,5,3,5,6,4,5,
%T A263001 6,3,6,6,2,9,3,5,5,5,6,5,6,5,4,7,4,7,4,5,6,7,3,5,6,7,4,7,7,5,3,9,5,7,
%U A263001 3,8,7,5,4,8,6,6,3,10,7,3,3,11,5,7,4,8,5,4,7,7,5,8,3,8,7,4,5,9,6,9
%N A263001 Number of ordered pairs (k, m) with k > 0 and m > 0 such that n = pi(k*(k+1)) + pi(m*(m+1)/2), where pi(x) denotes the number of primes not exceeding x.
%C A263001 Conjecture: a(n) > 0 for all n > 2, and a(n) = 1 only for n = 1, 4, 6.
%C A263001 We have verified this for n up to 10^5.
%C A263001 See also A262995, A262999 and A263020 for similar conjectures.
%H A263001 Zhi-Wei Sun, <a href="/A263001/b263001.txt">Table of n, a(n) for n = 1..10000</a>
%e A263001 a(1) = 1 since 1 = pi(1*2) + pi(1*2/2).
%e A263001 a(4) = 1 since 4 = pi(1*2) + pi(3*4/2).
%e A263001 a(6) = 1 since 6 = pi(2*3) + pi(3*4/2).
%t A263001 s[n_]:=s[n]=PrimePi[n(n+1)]
%t A263001 t[n_]:=t[n]=PrimePi[n(n+1)/2]
%t A263001 Do[r=0;Do[If[s[k]>n,Goto[bb]];Do[If[t[j]>n-s[k],Goto[aa]];If[t[j]==n-s[k],r=r+1];Continue,{j,1,n-s[k]+1}];Label[aa];Continue,{k, 1, n}];Label[bb];Print[n," ",r];Continue,{n,1,100}]
%Y A263001 Cf. A000217, A000720, A002378, A111208, A262995, A262999, A263020.
%K A263001 nonn
%O A263001 1,3
%A A263001 _Zhi-Wei Sun_, Oct 07 2015