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.

A274236 Numbers k such that k^4096 + (k+1)^4096 is prime.

This page as a plain text file.
%I A274236 #15 Apr 07 2025 14:57:29
%S A274236 311,2741,3582,5293,6289,12080,14082,16886,17971,19936,21454,21486,
%T A274236 26652,26904,28314,34693,35778,36292,40868,43819,46356,46467,49653,
%U A274236 53996,57150,58169,64937,67398,77383,82577,86031,86102,87352,87684,89030,93340,95346,97320,98191,111483,113947,118052,125442,125836,126157,127832,130794
%N A274236 Numbers k such that k^4096 + (k+1)^4096 is prime.
%C A274236 The terms correspond only to probable primes.
%H A274236 Richard Fischer, <a href="http://www.fermatquotient.com/PrimSerien/PrimPotP.txt">Primzahlen mit der Form (B+1)^N+B^N</a>.
%H A274236 Henri Lifchitz and Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=x%5E4096%2By%5E4096&amp;action=Search">Search for : x^4096+y^4096</a>.
%t A274236 Select[Range[1, 10000], PrimeQ[#^4096 + (#+1)^4096] &]
%o A274236 (PARI) for(n=1, 10000, if(isprime(n^4096 + (n+1)^4096), print1(n, ", ")))
%o A274236 (Magma) [n: n in [1..10000] |IsPrime(n^4096 + (n+1)^4096)];
%Y A274236 Cf. A005097, A027861, A155211, A153504, A154535, A174156, A174157, A215431, A215432, A215433, A274234, A274235, A274237.
%K A274236 nonn
%O A274236 1,1
%A A274236 _Tim Johannes Ohrtmann_, Jun 15 2016