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 A234900 #17 Jan 01 2014 12:51:45
%S A234900 2,3,5,131,167,211,439,2731,3167,3541,4261,7457,8447,18289,22669,
%T A234900 23201,23557,35401,44507,76781,88721,108131,126097,127079,136319,
%U A234900 141359,144139,159169,164089,177487,202627,261757,271181,282911,291971,307067,320561,389219,481589,482627,602867,624259,662107,682361,818887,907657,914189,964267,1040191,1061689
%N A234900 Primes p with P(p+1) also prime, where P(.) is the partition function (A000041).
%C A234900 It seems that this sequence contains infinitely many terms.
%C A234900 See also A234569 for a similar sequence.
%H A234900 Zhi-Wei Sun, <a href="/A234900/b234900.txt">Table of n, a(n) for n = 1..60</a>
%e A234900 a(1) = 2 since P(2+1) = 3 is prime.
%e A234900 a(2) = 3 since P(3+1) = 5 is prime.
%e A234900 a(3) = 5 since P(5+1) = 11 is prime.
%t A234900 p[k_]:=p[k]=PrimeQ[PartitionsP[Prime[k]+1]]
%t A234900 n=0;Do[If[p[k],n=n+1;Print[n," ",Prime[k]]],{k,1,10000}]
%Y A234900 Cf. A000040, A000041, A049575, A233346, A234470, A234514, A234530, A234567, A234569, A234615, A234644.
%K A234900 nonn
%O A234900 1,1
%A A234900 _Zhi-Wei Sun_, Jan 01 2014