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 A126911 #13 Oct 24 2021 09:09:08
%S A126911 10,24,60,148,174,180,268,274,280,294,346,472,484,516,522,598,654,804,
%T A126911 834,856,858,898,994,1012,1036,1054,1066,1102,1168,1272,1294,1338,
%U A126911 1342,1368,1420,1462,1500,1536,1564,1588,1608,1624,1710,1746,1786,1792,1822,1992
%N A126911 Numbers k such that 1 + k^2 + k^4 + k^6 + k^8 + k^10 + k^12 + k^13 is prime.
%H A126911 Daniel Starodubtsev, <a href="/A126911/b126911.txt">Table of n, a(n) for n = 1..10000</a>
%t A126911 a = {}; Do[If[PrimeQ[1 + n^2 + n^4 + n^6 + n^8 + n^10 + n^12 + n^13], AppendTo[a, n]], {n, 1, 1400}]; a
%o A126911 (PARI) is(n)=isprime(1+n^2+n^4+n^6+n^8+n^10+n^12+n^13) \\ _Charles R Greathouse IV_, Jun 13 2017
%o A126911 (Python)
%o A126911 from sympy import isprime
%o A126911 def ok(k): return isprime(1+sum(k**i for i in [2, 4, 6, 8, 10, 12, 13]))
%o A126911 print([k for k in range(2000) if ok(k)]) # _Michael S. Branicky_, Oct 24 2021
%Y A126911 Cf. A049407, A124175 A124176 A124177, A124178, A124179, A124180, A124181, A126908-A126916.
%K A126911 nonn,easy
%O A126911 1,1
%A A126911 _Artur Jasinski_, Dec 31 2006