This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 5
 19, 43, 43, 67, 67, 163, 163, 163, 163, 163, 163, 77683, 77683, 1333963, 2404147, 2404147, 20950603, 36254563, 51599563, 96295483, 96295483, 114148483, 269497867, 269497867, 269497867, 269497867, 585811843, 52947440683 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS (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 LINKS William P. Orrick, Table of n, a(n) for n = 1..58 (first 28 terms from N. J. A. Sloane) M. J. Jacobson, Jr., Computational Techniques in Quadratic Fields, Master's thesis, University of Manitoba, Winnipeg, Manitoba, 1995.  (This sequence is given in Table 6.6.) Michael John Jacobson Jr. and Hugh C. Williams, New quadratic polynomials with high densities of prime values, Math. Comp. 72 (2003), 499-519. D. H. Lehmer, E. Lehmer and D. Shanks, Integer sequences having prescribed quadratic character, Math. Comp., 24 (1970), 433-451. FORMULA a(n) = 4*A181667(n+1) - 1. -  William P. Orrick, Mar 19 2017 PROG (PARI) isok(m, oddpn) = {forprime(q=3, oddpn, if (kronecker(-m, q) != -1, return (0)); ); return (1); } a(n) = {oddpn = prime(n+1); m = 3; while(! isok(m, oddpn), m += 8); m; } \\ Michel Marcus, Oct 17 2017 CROSSREFS Cf. A094842, A094843, A001987, A001986, A181667. Sequence in context: A140603 A139580 A156897 * A001986 A270123 A139811 Adjacent sequences:  A094838 A094839 A094840 * A094842 A094843 A094844 KEYWORD nonn,changed AUTHOR N. J. A. Sloane, Jun 13 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.