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 A253471 #30 Jun 27 2023 17:17:21
%S A253471 2,56,10112,63880,78296,125330,222748,1839730
%N A253471 Numbers k such that 3^k + k^3 is prime.
%C A253471 All terms == 2 or 4 mod 6. - _Robert Israel_, Jan 01 2015
%e A253471 2 is in the sequence because 3^2 + 2^3 = 17 is prime.
%e A253471 56 is in the sequence because 3^56 + 56^3 = 523347633027360537213687137 is prime.
%p A253471 select(t -> isprime(3^t+t^3), [seq(seq(6*i+j, j=[2,4]), i=0..100)]); # _Robert Israel_, Jan 01 2015
%t A253471 Do[If[PrimeQ[3^n+n^3], Print[n]], {n, 0, 12000}]
%o A253471 (PARI) is(n)=ispseudoprime(3^n+n^3) \\ _Charles R Greathouse IV_, Jun 06 2017
%Y A253471 Cf. A001585 (3^n + n^3), A064539 (2^n + n^2 is prime), A094133 (Leyland primes).
%K A253471 nonn,hard,more
%O A253471 1,1
%A A253471 _Michel Lagneau_, Jan 01 2015
%E A253471 a(4)-a(7) from _Hans Havermann_, Apr 30 2015
%E A253471 a(8) from _Ryan Propper_, Jun 27 2023