Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #88 Oct 19 2014 16:00:38
%S 4,6,18,42,72,102,270,282,312,618,1032,1062,1320,1950,2082,3528,7350,
%T 7488,10332,15138,17388,21600,40038,44700,134922,156258,187908,243708,
%U 339138,389568,495360,610920,761712,911292,916218,943800,1013532,1217472,1312602
%N Numbers m with m - 1, m + 1 and q(m) + 1 all prime, where q(.) is the strict partition function (A000009).
%C Clearly, any term after the first term 4 is a multiple of 6. By part (i) of the conjecture in A235343, this sequence should have infinitely many terms. The prime q(a(51)) + 1 = q(3235368) + 1 has 1412 decimal digits.
%C See A235356 for primes of the form q(m) + 1 with m - 1 and m + 1 both prime.
%C See also A235346 for a similar sequence.
%H Zhi-Wei Sun, <a href="/A235344/b235344.txt">Table of n, a(n) for n = 1..51</a>
%H Zhi-Wei Sun, <a href="http://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;2a0328e6.1401">Twin primes and the strict partition function</a>, a message to Number Theory List, Jan. 15, 2014.
%H Z.-W. Sun, <a href="http://arxiv.org/abs/1402.6641">Problems on combinatorial properties of primes</a>, arXiv:1402.6641, 2014
%e a(1) = 4 since 4 - 1, 4 + 1 and q(4) + 1 = 3 are all prime.
%e a(2) = 6 since 6 - 1, 6 + 1 and q(6) + 1 = 5 are all prime.
%t f[k_]:=PartitionsQ[Prime[k]+1]+1
%t n=0;Do[If[PrimeQ[Prime[k]+2]&&PrimeQ[f[k]],n=n+1;Print[n," ",Prime[k]+1]],{k,1,10000}]
%Y Cf. A000009, A000040, A014574, A234530, A234569, A234644, A235343, A235346, A235356, A235357, A235358.
%K nonn,hard
%O 1,1
%A _Zhi-Wei Sun_, Jan 06 2014