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 A235982 #15 Jul 08 2019 12:00:25
%S A235982 82,38950082,47458322,131079602,1982119442,25856961602,58120048562,
%T A235982 602425897922,1053022816562,1267247769842,3491998578722,7181161893362,
%U A235982 7759350084722,10756569837842,16948379819282,28424689653362,33122338550402,36562351115762,50897394646082
%N A235982 Numbers n of the form p^4 + 1 (for prime p) such that n^4 + 1 is also prime.
%C A235982 All numbers are congruent to 2 mod 20.
%e A235982 10756569837842 = 1811^4 + 1 (1811 is prime) and 10756569837842^4 + 1 is prime, so 10756569837842 is a member of this sequence.
%t A235982 nfp4Q[n_]:=Module[{p=Surd[n-1,4]},AllTrue[{p,n^4+1},PrimeQ]]; Select[ Range[ 2700]^4+ 1,nfp4Q] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Jul 08 2019 *)
%o A235982 (Python)
%o A235982 import sympy
%o A235982 from sympy import isprime
%o A235982 {print(n**4+1) for n in range(10000) if isprime(n) if isprime((n**4+1)**4+1)}
%Y A235982 Cf. A002523, A000068.
%K A235982 nonn
%O A235982 1,1
%A A235982 _Derek Orr_, Jan 17 2014