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 A234530 #32 Apr 23 2017 15:12:14
%S A234530 2,3,11,13,29,37,47,71,79,89,103,127,131,179,181,197,233,271,331,379,
%T A234530 499,677,691,757,887,911,1019,1063,1123,1279,1429,1531,1559,1637,2251,
%U A234530 2719,3571,4007,4201,4211,4297,4447,4651,4967,5953,6131,7937,8233,8599,8819,9013,11003,11093,11813,12251,12889,12953,13487,13687,15259
%N A234530 Primes p with q(p) + 1 also prime, where q(.) is the strict partition function (A000009).
%C A234530 By the conjecture in A234514, this sequence should have infinitely many terms.
%C A234530 It seems that a(n+1) < a(n) + a(n-1) for all n > 4.
%C A234530 See A234366 for primes of the form q(p) + 1 with p prime.
%C A234530 See also A234644 for a similar sequence.
%H A234530 Zhi-Wei Sun, <a href="/A234530/b234530.txt">Table of n, a(n) for n = 1..150</a>
%e A234530 a(1) = 2 since 2 and q(2) + 1 = 2 are both prime.
%e A234530 a(2) = 3 since 3 and q(3) + 1 = 3 are both prime.
%e A234530 a(3) = 11 since 11 and q(11) + 1 = 13 are both prime.
%t A234530 n=0;Do[If[PrimeQ[PartitionsQ[Prime[k]]+1],n=n+1;Print[n," ",Prime[k]]],{k,1,10^5}]
%t A234530 Select[Prime[Range[2000]],PrimeQ[PartitionsQ[#]+1]&] (* _Harvey P. Dale_, Apr 23 2017 *)
%Y A234530 Cf. A000009, A000040, A233346, A233393, A234366, A234470, A234475, A234514, A234567, A234569, A234572, A234615, A234644, A234647
%K A234530 nonn
%O A234530 1,1
%A A234530 _Zhi-Wei Sun_, Dec 27 2013