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 A235357 #17 Oct 19 2014 06:26:25
%S A235357 3,4919887991,28253252977151,20964758762885249107967,
%T A235357 47573613463034233651199,12796446358667905839216959,
%U A235357 10712934162879755412803989317623807,33014011446550388413724585366558782455972162239
%N A235357 Primes of the form q(m) - 1 with m - 1 and m + 1 both prime, where q(.) is the strict partition function (A000009).
%C A235357 Though the primes in this sequence are very rare, by part (ii) of the conjecture in A235343, there should be infinitely many such primes.
%C A235357 See A235346 for a list of known numbers m with m - 1, m + 1 and q(m) - 1 all prime.
%C A235357 See also A235356 for a similar sequence.
%H A235357 Zhi-Wei Sun, <a href="/A235357/b235357.txt">Table of n, a(n) for n = 1..25</a>
%F A235357 a(n) = A000009(A235346(n)) - 1.
%e A235357 a(1) = 3 since 3 = q(6) - 1 with 6 - 1 and 6 + 1 both prime.
%t A235357 g[n_]:=A235346(n)
%t A235357 Table[PartitionsQ[g[n]]-1,{n,1,10}]
%Y A235357 Cf. A000009, A000040, A014574, A235343, A235344, A235346, A235356.
%K A235357 nonn,hard
%O A235357 1,1
%A A235357 _Zhi-Wei Sun_, Jan 07 2014