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 A236440 #13 Apr 06 2014 10:48:15
%S A236440 2,3,4,13,18,23,44,52,54,67,82,93,139,155,166,185,196,249,299,333,382,
%T A236440 559,574,911,939,1076,1077,1386,1707,1710,1872,2041,2120,2172,2234,
%U A236440 2810,3272,3407,3442,3469,3551,3657,3694,4185,4282,4469,4554,5273,5315,5729
%N A236440 Positive integers m with A000009(m)^2 + A047967(m)^2 prime.
%C A236440 According to the conjecture in A236439, this sequence should have infinitely many terms.
%H A236440 Zhi-Wei Sun, <a href="/A236440/b236440.txt">Table of n, a(n) for n = 1..200</a>
%H A236440 Z.-W. Sun, <a href="http://arxiv.org/abs/1402.6641">Problems on combinatorial properties of primes</a>, arXiv:1402.6641, 2014
%e A236440 a(1) = 2 since A000009(2)^2 + A047967(2)^2 = 1^2 + 1^2 =2 is prime, but A000009(1)^2 + A047967(1)^2 = 1^2 + 0^2 is not.
%t A236440 pq[n_]:=PrimeQ[PartitionsQ[n]^2+(PartitionsP[n]-PartitionsQ[n])^2]
%t A236440 n=0;Do[If[pq[m],n=n+1;Print[n," ",m]],{m,1,10000}]
%Y A236440 Cf. A000009, A000040, A047967, A236413, A236418, A236439.
%K A236440 nonn
%O A236440 1,1
%A A236440 _Zhi-Wei Sun_, Jan 25 2014