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 A289839 #17 Feb 16 2025 08:33:49 %S A289839 31,47,79,127,191,271,367,479,607,751,911,1087,1279,1487,1951,2207, %T A289839 2767,3391,3727,4079,4447,4831,5231,5647,6079,6991,9007,9551,10111, %U A289839 10687,11279,11887,12511,13151,13807,14479,17327,20431,21247,22079,24671,26479,27407 %N A289839 Primes of the form 8*n^2+8*n+31. %C A289839 The first 14 terms correspond to n from 0 to 13, which makes 8*n^2+8*n+31 a prime-generating polynomial (see the link). %C A289839 This is a prime-generating polynomial of the form c*n^2+c*n+p, where c=2^k (k=0,1,2...) and p is prime with c and p containing at most two digits. Prime-generating polynomials of this kind arise for k=0,1,2,3 - see A005846 and A007635 (k=0), A007639 (k=1), and A048988 (k=2). %C A289839 All terms are of the form 4m+3. Terms 1 and 4 are Mersenne primes (A000668). %H A289839 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a> %e A289839 79 is a term as it is a prime corresponding to n=2: 8*4+8*2+31=79. %t A289839 Select[Range[0,100]//8#^2+8#+31&, PrimeQ] %o A289839 (PARI) for(n=0, 100, isprime(p=8*n^2+8*n+31)&& print1(p ", ")) %Y A289839 Cf. A000040 (primes), A005846, A007635, A007639, A048988, A281437, A292578 (similar prime-generating sequences). %K A289839 nonn %O A289839 1,1 %A A289839 _Waldemar Puszkarz_, Oct 06 2017