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 A234366 #19 Dec 28 2013 03:51:05
%S A234366 2,3,13,19,257,761,2591,32993,70489,173683,570079,3725411,5010689,
%T A234366 132535703,150473569,406072423,3328423937,26114971541,519999315041,
%U A234366 4743946406977,704890732521793,445433800804233383,712827068077888961
%N A234366 Primes of the form q(p) + 1, where p is a prime and q(.) is the strict partition function (A000009).
%C A234366 Though the primes in this sequence are very rare, by the conjecture in A234514 there should be infinitely many such primes.
%H A234366 Zhi-Wei Sun, <a href="/A234366/b234366.txt">Table of n, a(n) for n = 1..120</a>
%F A234366 a(n) = A000009(A234530(n)) + 1.
%e A234366 a(1) = 2 since 2 = q(2) + 1 with 2 prime.
%e A234366 a(2) = 3 since 3 = q(3) + 1 with 3 prime.
%e A234366 a(3) = 13 since 13 = q(11) + 1 with 11 and 13 both prime.
%t A234366 p[n_]:=A234530(n)
%t A234366 Table[PartitionsQ[p[n]]+1,{n,1,35}]
%Y A234366 Cf. A000009, A000040, A234514, A234530
%K A234366 nonn
%O A234366 1,1
%A A234366 _Zhi-Wei Sun_, Dec 28 2013