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.
lst={}; Do[p=n^6-2; If[PrimeQ[p], If[PrimeQ[n], AppendTo[lst,n]]], {n,0,3*7!}]; lst
[n: n in [1..500]|IsPrime(n^7-2)]; // Vincenzo Librandi, Nov 26 2010
lst={};Do[p=n^7-2;If[PrimeQ[p],AppendTo[lst,n]],{n,0,7!}];lst
Select[Range[2*10^3], PrimeQ[#^7 - 2] &] (* Vincenzo Librandi, Mar 20 2014 *)
is(n)=isprime(n^7-2) \\ Charles R Greathouse IV, Feb 17 2017
lst={}; Do[p=n^7-2; If[PrimeQ[p], If[PrimeQ[n], AppendTo[lst,n]]], {n,0,8!}]; lst
n=3: n^4 = 81; {79,83} are primes.
lst={}; Do[p1=n^4-2; p2=n^4+2; If[PrimeQ[p1]&&PrimeQ[p2],AppendTo[lst,n]],{n,0,8!}]; lst (* Vladimir Joseph Stephan Orlovsky, Jan 17 2009 *)
Select[Range[730000], AllTrue[#^4 + {2, -2}, PrimeQ] &] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Jan 02 2018 *)
[n: n in [1..500] | IsPrime(n^6-2) and IsPrime(n^6+2)]; // Vincenzo Librandi, Nov 26 2010
lst={};Do[p1=n^6-2;p2=n^6+2;If[PrimeQ[p1]&&PrimeQ[p2],AppendTo[lst,n]],{n,0,9!}];lst
Select[Range[30000],AllTrue[#^6+{2,-2},PrimeQ]&] (* Harvey P. Dale, Jun 21 2025 *)