|
%I #18 Jan 22 2019 02:48:55
%S 1,2,4,1,10,1,16,1,1,2,1,1,40,1,1,1,2,1,1,2,1,1,1,1,1,4,1,3,1,1,1,1,2,
%T 1,2,1,1,1,1,1,2,1,3,1,2,1,1,1,4,1,1,2,1,1,1,1,2,1,1,2,1,1,1,3,1,1,1,
%U 1,5,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,1
%N Prime production length of the polynomial P = x^2 + x + prime(n): max { k>0 | P(x) is prime for all x=0,...,k-1 }.
%C a(n) > 0 by definition, and a(n) > 1 iff n is a twin prime; a(n) would be zero for composite n if "prime(n)" was replaced by n.
%C Euler's original "prime producing polynomial" was P = x^2 - x + 41; changing the sign increases the prime production length by 1.
%H Robert Israel, <a href="/A208936/b208936.txt">Table of n, a(n) for n = 1..10000</a>
%H Shaoji Xu, <a href="http://m-hikari.com/ija/ija-2012/ija-1-4-2012/xushaojiIJA1-4-2012.pdf">On Euler Polynomials and Rabinowitsch Polynomials</a>, International Journal of Algebra, Vol. 6, 2012, no. 3, 123 - 134.
%p A208936:= proc(n) local N,r;
%p N:= ithprime(n);
%p for r from 1 do
%p if not isprime(r^2+r+N) then return(r) end if
%p end do
%p end proc; # _Robert Israel_, Feb 11 2013
%o (PARI) a(n)={n=prime(n); for( x=1, 1e9, isprime(x^2+x+n) | return(x))}
%K nonn
%O 1,2
%A _M. F. Hasler_, Mar 03 2012
|
