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 A033209 #34 Jan 16 2018 02:51:51 %S A033209 11,47,53,103,163,199,257,269,311,397,401,419,421,499,587,599,617,683, %T A033209 757,773,863,883,907,911,929,991,1021,1087,1109,1123,1181,1237,1291, %U A033209 1307,1367,1433,1439,1543,1567,1571,1609,1621,1697,1699,1753,1873,1907,2003 %N A033209 Primes of form x^2 + 11*y^2. %C A033209 Primes p such that the polynomial x^3-x^2-x-1 mod p has 3 zeros. Compare A106279. - _T. D. Noe_, May 02 2005 %D A033209 David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989. %H A033209 Vincenzo Librandi and Ray Chandler, <a href="/A033209/b033209.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Vincenzo Librandi) %H A033209 Tim Evink, Paul Alexander Helminck, <a href="https://arxiv.org/abs/1801.04605">Tribonacci numbers and primes of the form p=x^2+11y^2</a>, arXiv:1801.04605 [math.NT], 2018. %H A033209 N. J. A. Sloane et al., <a href="https://oeis.org/wiki/Binary_Quadratic_Forms_and_OEIS">Binary Quadratic Forms and OEIS</a> (Index to related sequences, programs, references) %t A033209 QuadPrimes2[1, 0, 11, 10000] (* see A106856 *) %Y A033209 Primes in A243651. %K A033209 nonn,easy %O A033209 1,1 %A A033209 _N. J. A. Sloane_ %E A033209 Extended by _T. D. Noe_, Apr 17 2012