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 A239343 #21 Jun 06 2017 14:36:45
%S A239343 0,2,36,42,56,72,98,122,134,156,162,182,212,302,338,386,486,492,576,
%T A239343 642,666,672,698,708,722,734,782,828,846,878,882,888,896,938,962,974,
%U A239343 986,992,1052,1062,1104,1106,1148,1182,1224,1244,1266,1284,1304,1338,1394
%N A239343 Numbers n such that n^5+5 is prime.
%C A239343 Note that all numbers in this sequence are even.
%C A239343 There is no sequence "Numbers n such that n^4+4 is prime" because of the factorization n^4 + 4 = (n^2 + 2n + 2)*(n^2 - 2n + 2). - _Michael B. Porter_, based on observation by _Derek Orr_, Mar 17 2014
%H A239343 Harvey P. Dale, <a href="/A239343/b239343.txt">Table of n, a(n) for n = 1..1000</a>
%e A239343 2^5+5 = 37 is prime. Thus, 2 is a member of this sequence.
%e A239343 36^5+5 = 60466181 is prime. Thus, 36 is a member of this sequence.
%t A239343 Select[Range[0,1500],PrimeQ[#^5+5]&] (* _Harvey P. Dale_, Feb 03 2015 *)
%o A239343 (Python)
%o A239343 import sympy
%o A239343 from sympy import isprime
%o A239343 {print(n) for n in range(10**4) if isprime(n**5+5)}
%o A239343 (PARI) is(n)=isprime(n^5+5) \\ _Charles R Greathouse IV_, Jun 06 2017
%Y A239343 Cf. A067201, A049441.
%K A239343 easy,nonn
%O A239343 1,2
%A A239343 _Derek Orr_, Mar 16 2014