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 A239417 #11 Feb 20 2017 14:47:20
%S A239417 2,62,86,88,116,152,266,292,310,326,338,356,406,436,466,470,518,550,
%T A239417 568,616,626,650,688,700,722,812,850,926,956,992,1058,1076,1126,1186,
%U A239417 1252,1430,1550,1570,1642,1672,1682,1766,1808,1852,1868,1888,2138,2210,2306
%N A239417 Numbers n such that n^9-9 is prime.
%C A239417 Note that all numbers in this sequence are even.
%e A239417 2^9-9 = 503 is prime. Thus, 2 is a member of this sequence.
%o A239417 (Python)
%o A239417 import sympy
%o A239417 from sympy import isprime
%o A239417 {print(n) for n in range(10**4) if isprime(n**9-9)}
%o A239417 (PARI) is(n)=isprime(n^9-9) \\ _Charles R Greathouse IV_, Feb 20 2017
%Y A239417 Cf. A028870, A153974, A239413, A239414, A239415, A239416, A239418, A239346.
%K A239417 nonn
%O A239417 1,1
%A A239417 _Derek Orr_, Mar 17 2014