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 A292578 #20 Feb 16 2025 08:33:51 %S A292578 43,109,197,307,439,593,769,967,1187,1429,1693,1979,2287,2617,2969, %T A292578 3343,3739,4157,4597,5059,6577,7127,7699,8293,9547,10889,11593,14629, %U A292578 15443,17137,18919,19843,20789,21757,24793,25849,26927,28027,30293,32647,33857,35089 %N A292578 Primes of the form 11*n^2 + 55*n + 43. %C A292578 The first 20 terms correspond to n from 0 to 19, which makes 11*n^2 + 55*n + 43 a prime-generating polynomial (see the link). %C A292578 There are only a few prime-generating quadratic polynomials whose coefficients contain at most two digits that produce 20 or more primes in a row. This is one of them, others include A005846, A007641, A060844, and A007637. %H A292578 Robert Israel, <a href="/A292578/b292578.txt">Table of n, a(n) for n = 1..10000</a> %H A292578 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a> %p A292578 select(isprime, [seq(11*n^2+55*n+43,n=0..100)]); # _Robert Israel_, Oct 01 2017 %t A292578 Select[Range[0,100]//11#^2+55#+43 &, PrimeQ] %o A292578 (PARI) for(n=0, 100, isprime(p=11*n^2+55*n+43)&& print1(p ", ")) %Y A292578 Cf. A000040, A005846, A007641, A060844, A007637 (similar sequences). %K A292578 nonn %O A292578 1,1 %A A292578 _Waldemar Puszkarz_, Sep 19 2017