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 A274235 #14 Sep 06 2024 15:58:56 %S A274235 754,1289,1368,1813,3159,3280,3301,4976,6204,6283,6723,6904,7141, %T A274235 10246,11417,13268,15456,19428,19683,19698,20298,21484,22543,23702, %U A274235 23815,24747,27010,32319,34133,36201,37030,39438,41292,44472,47623,50198,51031,51370,51521,52628,53073,53309,53767,55911,56630,59424 %N A274235 Numbers n such that n^2048 + (n+1)^2048 is prime. %C A274235 The terms correspond only to probable primes. %H A274235 Richard Fischer, <a href="http://www.fermatquotient.com/PrimSerien/PrimPotP.txt">Primzahlen mit der Form (B+1)^N+B^N</a>. %H A274235 Henri Lifchitz & Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=x%5E2048%2By%5E2048&action=Search">Search for : x^2048+y^2048</a>. %t A274235 Select[Range[1, 10000], PrimeQ[#^2048 + (#+1)^2048] &] %o A274235 (PARI) for(n=1, 10000, if(isprime(n^2048 + (n+1)^2048), print1(n, ", "))) %o A274235 (Magma) [n: n in [1..10000] |IsPrime(n^2048 + (n+1)^2048)]; %Y A274235 Cf. A005097, A027861, A155211, A153504, A154535, A174156, A174157, A215431, A215432, A215433, A274234, A274236, A274237. %K A274235 nonn %O A274235 1,1 %A A274235 _Tim Johannes Ohrtmann_, Jun 15 2016