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 A375217 #26 Nov 19 2024 09:00:00 %S A375217 37,53,181,491,547,619,661,677,911,941,1297,1423,1867,2441,2687,3137, %T A375217 3571,5387,5821,5881,6449,6551,6899,8263,8537,8999,9803,9931,10861, %U A375217 11057,11131,11423,12377,12941,13147,14009,14519,14759,14813,15493,16103,16573,19949 %N A375217 Primes p such that p^64 + 2^64 is prime. %C A375217 It is conjectured that solutions for p1^n + p2^n = p3 (where p1, p2, and p3 are all primes and n is a natural number) exist only when n is itself a power of two (when n is a number in A000079); and would have infinitely many solutions. %C A375217 But it's proven that either p1 or p2 must be a 2. %H A375217 Mykhailo Papenko, <a href="/A375217/b375217.txt">Table of n, a(n) for n = 1..8079</a> %H A375217 Mykhailo Papenko, <a href="https://github.com/PiTBody/Primes-Made-Up-of-Primes">Primes-Made-Up-of-Primes</a>, Github. %F A375217 p^64 + 2^64 ∈ A000040 (p^64 + 2^64 belongs to the set of the prime numbers) %t A375217 Select[Prime[Range[2255]],PrimeQ[#^64+2^64]&] (* _James C. McMahon_, Nov 19 2024 *) %o A375217 (Java) /* see link for code with instructions */ %Y A375217 6th row of A132260. %K A375217 nonn %O A375217 1,1 %A A375217 _Mykhailo Papenko_, Oct 17 2024