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 A239346 #9 Jun 06 2017 14:36:40
%S A239346 2,4,10,20,40,98,100,118,122,134,140,164,190,262,272,362,400,410,494,
%T A239346 592,602,632,638,664,830,860,862,880,938,944,962,1120,1148,1162,1202,
%U A239346 1288,1340,1360,1408,1498,1594,1642,1772,1802,1840,1870,1874,1882,1960,2078,2092,2158,2170,2188,2348,2368,2462,2474,2482,2488,2498
%N A239346 Numbers n such that n^9+9 is prime.
%C A239346 Note that all numbers in this sequence are even.
%e A239346 2^9+9 = 521 is prime. Thus, 2 is a member of this sequence.
%o A239346 (Python)
%o A239346 import sympy
%o A239346 from sympy import isprime
%o A239346 {print(n) for n in range(10**4) if isprime(n**9+9)}
%o A239346 (PARI) is(n)=isprime(n^9+9) \\ _Charles R Greathouse IV_, Jun 06 2017
%Y A239346 Cf. A067201, A049441.
%K A239346 easy,nonn
%O A239346 1,1
%A A239346 _Derek Orr_, Mar 16 2014