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 A158361 #16 Nov 28 2024 15:57:09 %S A158361 3,5,7,11,17,19,23,37,41,59,61,71,79,97,131,139,179,223,227,229,241, %T A158361 283,313,317,359,367,379,383,389,439,449,461,487,503,521,569,593,617, %U A158361 619,631,661,683,709,733,811,821,853,911,977,1049,1061,1063,1069,1091,1093,1117 %N A158361 Primes p with property that Q = p^4 + 2^4 is prime. %C A158361 Q is always congruent to 1 (mod 4). %C A158361 Q is divisible by 17 if p is congruent to 1, 4, 13, or 16 (mod 17). %C A158361 It is conjectured that sequence a(n) is infinite. %C A158361 Q is in A094479. - _Zak Seidov_, Jul 08 2020 %D A158361 Leonard E. Dickson, History of the Theory of numbers, vol. I, Dover Publications 2005 %D A158361 Richard Guy, "Unsolved Problems in Number Theory" %H A158361 Vincenzo Librandi, <a href="/A158361/b158361.txt">Table of n, a(n) for n = 1..1000</a> %e A158361 3 is in the sequence since for p=3: p^4+2^4 = 3^4+16 = 97 is prime. %e A158361 29 is not in the sequence since 29^4+2^4 = 707297 = 73 x 9689 is not prime. %t A158361 Select[Range[10^3], PrimeQ[#] && PrimeQ[#^4 + 16] &] (* _Vincenzo Librandi_, Jun 18 2014 *) %t A158361 Select[Prime[Range[200]],PrimeQ[#^4+16]&] (* _Harvey P. Dale_, Jun 23 2014 *) %o A158361 (PARI) isA158361(n) = isprime(n) && isprime(n^4+16) %o A158361 (Magma) [p: p in PrimesUpTo(2000) | IsPrime(p^4+16)]; // _Vincenzo Librandi_, Jun 18 2014 %Y A158361 Cf. A062324, A094479, A157950, A157764. %K A158361 nonn,easy %O A158361 1,1 %A A158361 Ulrich Krug (leuchtfeuer37(AT)gmx.de), Mar 17 2009 %E A158361 Corrected and edited by _Michael B. Porter_, Dec 17 2009