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 A234647 #7 Dec 30 2013 22:49:49
%S A234647 2,11,17,37,53,103,1259,1609,5119,9791,70487,570077,20792119,
%T A234647 281138047,23515017983,35692320959,48626519093,3626048321047,
%U A234647 27077619952639,1651411233432319,10743948315198451,13378670620050079,39413984631175423,58553713102334907283,145464242180631569963,25408177717067357968543,1374387931601409538722802926765483199,20557774525717988142856527912112710143,326033386646595458662191828888146112979,27403889354101748193301659902924397784656229
%N A234647 Primes of the form q(p) - 1, where p is a prime and q(.) is the strict partition function (A000009).
%C A234647 Though the primes in this sequence are very rare, by the conjecture in A234615 there should be infinitely many such primes.
%C A234647 See A234644 for a list of known primes p with q(p) - 1 prime.
%H A234647 Zhi-Wei Sun, <a href="/A234647/b234647.txt">Table of n, a(n) for n = 1..100</a>
%F A234647 a(n) = A000009(A234615(n)) - 1.
%p A234647 a(1) = 2 since 2 = q(5) - 1 with 2 and 5 both prime.
%t A234647 p[n_]:=A234615(n)
%t A234647 Table[PartitionsQ[p[n]]-1,{n,1,30}]
%Y A234647 Cf. A000009, A000040, A234366, A234470, A234475, A234514, A234530, A234567, A234569, A234572, A234615, A234644
%K A234647 nonn
%O A234647 1,1
%A A234647 _Zhi-Wei Sun_, Dec 29 2013