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 #9 Sep 04 2017 19:19:37
%S 1,2,4,5,7,11,13,14,16,19,20,23,26,32,37,40,49,53,56,58,61,65,68,70,
%T 74,76,77,79,88,89,98,100,104,109,110,116,118,130,137,140,142,146,149,
%U 152,154,160,161,163,166,167,172,175,187,188,191,193,202,205,208,214,217
%N Numbers n such that n-th and (n+2)th triangular numbers sum up to a prime.
%C Or, numbers n such that 3+3n+n^2 is prime.
%H Robert Israel, <a href="/A128815/b128815.txt">Table of n, a(n) for n = 1..10000</a>
%F Tr(n)+Tr(n+2) is prime; A000217(n)+A000217(n+2) is prime.
%e 7 is a term because 7*8/2+9*10/2=73 is prime;
%e 11 is a term because 11*12/2+13*14/2=157 is prime.
%p select(t -> isprime(3+3*t+t^2), [$1..10000]); # _Robert Israel_, May 19 2014
%t Select[Range[300],PrimeQ[3+3#+#^2]&]
%t Position[Partition[Accumulate[Range[250]],3,1],_?(PrimeQ[#[[1]]+ #[[3]]]&), 1,Heads->False]//Flatten (* _Harvey P. Dale_, Sep 04 2017 *)
%Y Cf. A000217.
%K nonn
%O 1,2
%A _Zak Seidov_, Apr 10 2007