cp's OEIS Frontend

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.

A211238 Prime numbers p such that x^2 + x + p produces primes for x = 0..9 but not x = 10.

This page as a plain text file.
%I A211238 #8 Feb 27 2018 22:15:25
%S A211238 11,844427,51448361,86966771,122983031,960959381,2426256797,
%T A211238 2911675511,3013107257,4778888351,5221343711,5258591537,6430890287,
%U A211238 7156316591,8518049207,8828280941,9467776751,10687380227,10783636931,11856793337,12128287007,14431067237,14772642497
%N A211238 Prime numbers p such that x^2 + x + p produces primes for x = 0..9 but not x = 10.
%C A211238 The first term is A164926(10).
%H A211238 Zak Seidov, <a href="/A211238/b211238.txt">Table of n, a(n) for n = 1..133</a>
%t A211238 lookfor = 10; t = {}; n = 0; While[Length[t] < 25, n++; c = Prime[n]; i = 1; While[PrimeQ[i^2 + i + c], i++]; If[i == lookfor, AppendTo[t, c]]]; t
%Y A211238 Cf. A067774, A164926.
%K A211238 nonn
%O A211238 1,1
%A A211238 _T. D. Noe_, Apr 08 2012