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 A050265 #38 Feb 16 2025 08:32:40 %S A050265 11,13,19,29,43,61,83,109,139,173,211,349,461,523,659,733,811,1069, %T A050265 1163,1579,1693,1811,1933,2749,3373,3539,3709,4243,4813,5011,5419, %U A050265 5843,7211,7699,7949,8461,9533,9811,10093,11261,13789,14461,15149,16573 %N A050265 Primes of the form 2*n^2 + 11. %C A050265 The polynomial 2*n^2 + 11 first fails to produce a prime for n = 11, giving 253 = 11 * 23. - _Alonso del Arte_, Sep 04 2016 %C A050265 Let P(n) = 2*n^2 + 11. The polynomial P(2*n - 10) = 8*n^2 - 80*n + 11 produces prime values (not distinct) for n = 0 to 10. The polynomial P(3*n - 19) = 18*n^2 - 228*n + 733 produces distinct prime values for n = 0 to 9. - _Peter Bala_, Apr 16 2018 %H A050265 Vincenzo Librandi, <a href="/A050265/b050265.txt">Table of n, a(n) for n = 1..10000</a> %H A050265 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-generating Polynomial.</a> %F A050265 a(n) = 11 + 2*(A092968(n))^2. - _R. J. Mathar_, Jan 03 2009 %t A050265 Select[2Range[0, 100]^2 + 11, PrimeQ] (* _Harvey P. Dale_, May 20 2011 *) %o A050265 (Magma) [a: n in [0..100] | IsPrime(a) where a is 2*n^2+11]; // _Vincenzo Librandi_, Dec 08 2011 %Y A050265 Cf. A005846, A007641. %K A050265 nonn,easy %O A050265 1,1 %A A050265 _Eric W. Weisstein_ %E A050265 11 added by _Vincenzo Librandi_, Dec 08 2011