This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091968 Primes congruent to 3 (mod 16). 9
 3, 19, 67, 83, 131, 163, 179, 211, 227, 307, 419, 467, 499, 547, 563, 643, 659, 691, 739, 787, 883, 947, 1091, 1123, 1171, 1187, 1283, 1427, 1459, 1523, 1571, 1619, 1667, 1699, 1747, 1811, 1907, 1987, 2003, 2083, 2099, 2131, 2179, 2243, 2339, 2371, 2467 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For any n, the equations x^4 - y^4 = a(n)*z^2 and x^4 - a(n)^2*y^4 = z^2 are not solvable in natural numbers. - Arkadiusz Wesolowski, Aug 15 2013 REFERENCES L. J. Mordell, Diophantine Equations, Ac. Press, p. 23. Trygve Nagell, Introduction to Number Theory, Chelsea Publishing Company, NY, 1964, p. 230. LINKS T. D. Noe, Table of n, a(n) for n = 1..1000 MATHEMATICA Select[Prime@Range[400], Mod[ #, 16] == 3 &] (* Ray Chandler, Dec 06 2006 *) PROG (PARI) is(n)=isprime(n) && n%16==3 \\ Charles R Greathouse IV, Jul 01 2016 CROSSREFS Cf. A092022, A093012. Sequence in context: A178747 A071245 A297744 * A158714 A064056 A211061 Adjacent sequences:  A091965 A091966 A091967 * A091969 A091970 A091971 KEYWORD nonn,easy AUTHOR Giovanni Teofilatto, Mar 14 2004 EXTENSIONS More terms from Ray Chandler, Mar 15 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 02:56 EST 2018. Contains 318087 sequences. (Running on oeis4.)