|
%I #29 Feb 21 2019 15:08:40
%S 5,53,173,173,293,437,9173,9173,24653,74093,74093,74093,170957,214037,
%T 214037,214037,2004917,44401013,71148173,154554077,154554077,
%U 163520117,163520117,163520117,261153653,261153653,1728061733
%N Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.
%C With an initial a(0) = 5, a(n) is the least fundamental discriminant D > 1 such that the first n + 1 primes are inert in the real quadratic field with discriminant D. See A094841 for the imaginary quadratic field case. - _Jianing Song_, Feb 15 2019
%C All terms are congruent to 5 mod 24. - _Jianing Song_, Feb 17 2019
%H Michael John Jacobson, Jr., <a href="http://hdl.handle.net/1993/18862">Computational Techniques in Quadratic Fields</a>, Master's thesis, University of Manitoba, Winnipeg, Manitoba, 1995.
%H 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 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.
%o (PARI) isok(m, oddpn) = {forprime(q=3, oddpn, if (kronecker(m, q) != -1, return (0));); return (1);}
%o a(n) = {oddpn = prime(n+1); m = 5; while(! isok(m, oddpn), m += 8); m;} \\ _Michel Marcus_, Oct 17 2017
%Y Cf. A094848, A094849, A094850.
%Y Cf. A094841 (the imaginary quadratic field case), A094842, A094843, A094844.
%Y See A001992, A094851, A094852, A094853 for the case where the terms are restricted to the primes.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Jun 14 2004
|
