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.

A243761 Primes of the form p^2 + pq + q^2, where p and q are consecutive primes.

This page as a plain text file.
%I A243761 #9 Feb 27 2023 11:04:46
%S A243761 19,109,433,1327,4567,6079,19687,49927,62233,103813,160087,172801,
%T A243761 238573,363313,395323,463363,583447,640333,753007,1145773,1529413,
%U A243761 1728247,1968301,2056753,2223967,2317927,2349679,2413927,3121201,3577393,4148953,4298443
%N A243761 Primes of the form p^2 + pq + q^2, where p and q are consecutive primes.
%H A243761 K. D. Bajpai, <a href="/A243761/b243761.txt">Table of n, a(n) for n = 1..8900</a>
%e A243761 19 is in the sequence because 2^2 + 2*3 + 3^2 = 19 is prime: 2 and 3 are consecutive primes.
%e A243761 109 is in the sequence because 5^2 + 5*7 + 7^2 = 109 is prime: 5 and 7 are consecutive primes.
%p A243761 with(numtheory): A243761:= proc() local k, p, q; p:=ithprime(n); q:=ithprime(n+1); k:=p^2 + p*q + q^2;  if isprime(k) then RETURN (k); fi; end: seq(A243761 (), n=1..500);
%t A243761 Select[Table[Prime[n]^2 + Prime[n] Prime[n + 1] + Prime[n + 1]^2, {n, 500}], PrimeQ[#] &]
%o A243761 (Python)
%o A243761 from itertools import islice
%o A243761 from sympy import isprime, nextprime
%o A243761 def A243761_gen(): # generator of terms
%o A243761     p, q = 2, 3
%o A243761     while True:
%o A243761         if isprime(r:=p*(p+q)+q**2):
%o A243761             yield r
%o A243761         p, q = q, nextprime(q)
%o A243761 A243761_list = list(islice(A243761_gen(),20)) # _Chai Wah Wu_, Feb 27 2023
%Y A243761 Cf. A000040, A007645, A003136.
%K A243761 nonn
%O A243761 1,1
%A A243761 _K. D. Bajpai_, Jun 10 2014