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 A239413 #14 Dec 30 2019 15:07:10
%S A239413 4,12,16,42,102,124,132,144,184,232,274,288,306,316,336,352,406,438,
%T A239413 478,582,606,622,706,742,754,762,814,832,916,922,964,984,996,1026,
%U A239413 1044,1072,1086,1096,1156,1174,1204,1258,1272,1366,1408,1416,1428,1432,1456
%N A239413 Numbers n such that n^5-5 is prime.
%C A239413 Note that all the numbers in this sequence are even.
%C A239413 There is no sequence "Numbers n such that n^4-4 is prime." since n^4 - 4 = (n^2 + 2)(n^2 - 2). - _Michael B. Porter_, Mar 18 2014
%e A239413 4^5-5 = 1019 is prime. Thus, 4 is a member of this sequence.
%t A239413 Select[Range[1500],PrimeQ[#^5-5]&] (* _Harvey P. Dale_, Dec 30 2019 *)
%o A239413 (Python)
%o A239413 import sympy
%o A239413 from sympy import isprime
%o A239413 {print(n) for n in range(10**4) if isprime(n**5-5)}
%o A239413 (PARI) is(n)=isprime(n^5-5) \\ _Charles R Greathouse IV_, Feb 17 2017
%Y A239413 Cf. A028870, A153974, A239343.
%K A239413 nonn,easy
%O A239413 1,1
%A A239413 _Derek Orr_, Mar 17 2014