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.

A118591 Larger of two consecutive primes whose sum is a square.

This page as a plain text file.
%I A118591 #18 Jul 12 2024 06:08:55
%S A118591 19,53,73,293,883,1153,1931,2593,3529,4051,6053,7207,7451,15139,20809,
%T A118591 21647,24203,26921,28807,34849,46819,53147,56453,69193,74507,83233,
%U A118591 84053,98573,103067,103969,109517,110459,112339,136247,149059,151253
%N A118591 Larger of two consecutive primes whose sum is a square.
%H A118591 Amiram Eldar, <a href="/A118591/b118591.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..600 from Harvey P. Dale)
%F A118591 a(n) = A151800(A061275(n)). - _Amiram Eldar_, Jul 12 2024
%e A118591 17 and 19 are consecutive primes whose sum is 36, a square, so 19 is a term.
%t A118591 Transpose[Select[Partition[Prime[Range[14000]],2,1],IntegerQ[ Sqrt[ Total[#]]]&]] [[2]] (* _Harvey P. Dale_, May 03 2012 *)
%o A118591 (PARI) g(n) = for(x=2,n,if(issquare(prime(x)+prime(x-1)),print1(prime(x)",")))
%o A118591 (PARI) lista(pmax) = {my(p1 = 2); forprime(p2 = 3, pmax, if(issquare(p1 + p2), print1(p2, ", ")); p1 = p2);} \\ _Amiram Eldar_, Jul 12 2024
%Y A118591 Cf. A061275, A151800.
%K A118591 easy,nonn
%O A118591 1,1
%A A118591 _Cino Hilliard_, May 08 2006