cp's OEIS Frontend

A094841 Let p = n-th odd prime. Then a(n) = least positive integer congruent to 3 modulo 8 such that Legendre(-a(n), q) = -1 for all odd primes q <= p.

%I A094841 #36 Feb 21 2019 15:08:24
%S A094841 19,43,43,67,67,163,163,163,163,163,163,77683,77683,1333963,2404147,
%T A094841 2404147,20950603,36254563,51599563,96295483,96295483,114148483,
%U A094841 269497867,269497867,269497867,269497867,585811843,52947440683
%N A094841 Let p = n-th odd prime. Then a(n) = least positive integer congruent to 3 modulo 8 such that Legendre(-a(n), q) = -1 for all odd primes q <= p.
%C A094841 (a(n-1) + 1)/4 is the least positive integer c such that x^2 + x + c is not divisible by the first n primes. This implies that a(n) is congruent to 19 mod 24 and that a(n) is congruent to 43 or 67 mod 120 for n > 1. - _William P. Orrick_, Mar 19 2017
%C A094841 With an initial a(0) = 3, a(n) is the negated fundamental discriminant D < 0 with the least absolute value such that the first n + 1 primes are inert in the imaginary quadratic field with discriminant D. See A094847 for the real discriminant case. - _Jianing Song_, Feb 15 2019
%H A094841 William P. Orrick, <a href="/A094841/b094841.txt">Table of n, a(n) for n = 1..58</a> (first 28 terms from N. J. A. Sloane)
%H A094841 M. J. Jacobson, Jr., <a href="http://pages.cpsc.ucalgary.ca/~jacobs/PDF/mthesis.pdf">Computational Techniques in Quadratic Fields</a>, Master's thesis, University of Manitoba, Winnipeg, Manitoba, 1995.  (This sequence is given in Table 6.6.)
%H A094841 Michael John Jacobson Jr. and Hugh C. Williams, <a href="https://doi.org/10.1090/S0025-5718-02-01418-7">New quadratic polynomials with high densities of prime values</a>, Math. Comp. 72 (2003), 499-519.
%H A094841 D. H. Lehmer, E. Lehmer and D. Shanks, <a href="https://doi.org/10.1090/S0025-5718-1970-0271006-X">Integer sequences having prescribed quadratic character</a>, Math. Comp., 24 (1970), 433-451.
%F A094841 a(n) = 4*A181667(n+1) - 1. - _William P. Orrick_, Mar 19 2017
%o A094841 (PARI) isok(m, oddpn) = {forprime(q=3, oddpn, if (kronecker(-m, q) != -1, return (0));); return (1);}
%o A094841 a(n) = {oddpn = prime(n+1); m = 3; while(! isok(m, oddpn), m += 8); m;} \\ _Michel Marcus_, Oct 17 2017
%Y A094841 Cf. A094842, A094843, A094844.
%Y A094841 Cf. A094847 (the real quadratic field case), A094848, A094849, A094850.
%Y A094841 See A001986, A001987, A094845, A094846 for the case where the terms are restricted to the primes.
%Y A094841 Cf. also A181667.
%K A094841 nonn
%O A094841 1,1
%A A094841 _N. J. A. Sloane_, Jun 13 2004