cp's OEIS Frontend

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.

A236431 Numbers n such that both prime(n)+n and prime(n)-n give a triangular number.

This page as a plain text file.
%I A236431 #10 Jul 22 2022 16:20:11
%S A236431 1,513,213796
%N A236431 Numbers n such that both prime(n)+n and prime(n)-n give a triangular number.
%C A236431 Intersection of A115882 and A115883.
%C A236431 The corresponding primes are 2, 3673, 2955107.
%C A236431 No more terms up to 10^12. - _Giovanni Resta_, Jan 26 2014
%e A236431 prime(1) is 2, and both 2+1=3 and 2-1=1 are triangular.
%t A236431 Select[Range[214000],AllTrue[{Sqrt[8(Prime[#]-#)+1],Sqrt[8(Prime[#]+#)+ 1]},OddQ]&] (* _Harvey P. Dale_, Jul 22 2022 *)
%o A236431 (PARI) lista(nn) = {p = primes(nn); for (n=1, #p, pn = p[n]; if (ispolygonal(pn - n, 3) && ispolygonal(pn + n, 3), print1(n, ", ")););}
%Y A236431 Cf. A115882, A115883.
%K A236431 nonn,bref,more
%O A236431 1,2
%A A236431 _Michel Marcus_, Jan 25 2014