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.
%I A260555 #10 Oct 08 2024 09:27:05 %S A260555 73,79,103,193,199,223,271,313,439,463,751,823,991,1039,1063,1087, %T A260555 1303,1423,1543,1567,1663,1759,1783,1831,1873,1999,2143,2287,2383, %U A260555 2503,2833,3343,3463,3583,3631,3823,3847,3943,4447,4513,4639,4783,5023,5167,5407 %N A260555 Primes p such that p = q^2 + 6*r^2 where q and r are also primes. %C A260555 Green & Sawhney prove that this sequence is infinite. - _Charles R Greathouse IV_, Oct 08 2024 %H A260555 Colin Barker, <a href="/A260555/b260555.txt">Table of n, a(n) for n = 1..1500</a> %H A260555 Ben Green and Mehtaab Sawhney, <a href="https://arxiv.org/abs/2410.04189">Primes of the form p^2 + nq^2</a>, arXiv preprint (2024). arXiv:2410.04189 [math.NT] %e A260555 73 is in the sequence because 73 = 7^2 + 6*2^2 and 73, 7 and 2 are all primes. %t A260555 Select[#1^2 + 6 #2^2 & @@ # & /@ Tuples[Prime@ Range@ 60, 2], PrimeQ] // Sort (* _Michael De Vlieger_, Jul 29 2015 *) %o A260555 (PARI) list(lim)=my(v=List()); lim\=1; forprime(q=2, sqrtint((lim-9)\6), my(t=6*q^2); forprime(p=3, sqrtint(lim-t), my(r=t+p^2); if(isprime(r), listput(v, r)))); Set(v) \\ _Charles R Greathouse IV_, Oct 08 2024 %Y A260555 Cf. A260553, A260554, A260556, A260557. %K A260555 nonn %O A260555 1,1 %A A260555 _Colin Barker_, Jul 29 2015