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 A350687 #10 Jan 12 2022 08:42:58 %S A350687 5,13,29,53,97,173,181,229,257,277,281,293,337,617,733,757,809,881, %T A350687 953,1009,1093,1097,1217,1229,1237,1289,1373,1409,1481,1549,1709,1777, %U A350687 1801,1873,1901,2017,2029,2153,2213,2281,2381,2521,2633 %N A350687 Primes of the form x^2 + (y^3 + z^3)^2 with x,y,z > 0. %C A350687 Merikoski proved that there are infinitely many primes of this form. %H A350687 Charles R Greathouse IV, <a href="/A350687/b350687.txt">Table of n, a(n) for n = 1..10000</a> %H A350687 Jori Merikoski, <a href="https://arxiv.org/abs/2112.03617">The polynomials X^2+(Y^2+1)^2 and X^2+(Y^3+Z^3)^2 also capture their primes</a>, arXiv:2112.03617 [math.NT], 2021. %o A350687 (PARI) listA003325(lim)=my(v=List()); lim\=1; for(x=1, sqrtnint(lim-1, 3), my(x3=x^3); for(y=1, min(sqrtnint(lim-x3, 3), x), listput(v, x3+y^3))); Set(v) %o A350687 list(lim)=lim\=1; my(v=List(),u=apply(sqr, listA003325(sqrtint(lim-1)))); for(x=1,sqrtint(lim-1), my(x2=x^2); for(i=1,#u, my(t=x2+u[i]); if(t>lim, break); if(isprime(t), listput(v,t)))); Set(v) %Y A350687 Subsequence of A002144. %Y A350687 Cf. A349900, A028916, A003325. %K A350687 nonn %O A350687 1,1 %A A350687 _Charles R Greathouse IV_, Jan 11 2022