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 A105126 #15 Apr 29 2015 16:06:33
%S A105126 41,73,89,137,233,281,313,409,457,521,569,601,617,761,809,857,937,953,
%T A105126 1033,1049,1097,1129,1193,1289,1321,1433,1481,1609,1657,1721,1753,
%U A105126 1801,1913,1993,2089,2137,2153,2281,2297,2377,2393,2441,2473,2521,2617,2633,2713
%N A105126 Primes of the form 16n+9.
%C A105126 A prime of the form 16n+9 is represented by exactly one of x^2 + 32y^2 and x^2 + 64y^2 (see Kaplanski link). - _Michel Marcus_, Dec 23 2012
%H A105126 T. D. Noe, <a href="/A105126/b105126.txt">Table of n, a(n) for n = 1..1000</a>
%H A105126 Irving Kaplansky, <a href="http://dx.doi.org/10.1090/S0002-9939-03-07022-9">The forms x+32y^2 and x+64y^2</a>, Proc. Amer. Math. Soc. 131 (2003), 2299-2300
%p A105126 M:=500; f:=proc(n) local t1,t2; t1:=[]; for k from 0 to M do t2:=2^n*k+2^(n-1)+1; if isprime(t2) then t1:=[op(t1),t2]; fi; od; t1; end; f(4);
%t A105126 lst={};Do[p=16*n+9;If[PrimeQ[p],AppendTo[lst,p]],{n,0,3*5!,1}];lst (* _Vladimir Joseph Stephan Orlovsky_, Jan 27 2009 *)
%o A105126 (PARI) select(n->n%16==9, primes(500)) \\ _Charles R Greathouse IV_, Apr 29 2015
%Y A105126 Cf. A002145, A007521, A105127-A105132.
%K A105126 nonn
%O A105126 1,1
%A A105126 _N. J. A. Sloane_, based on correspondence from _Marco Matosic_, Apr 11 2005