login
This site is supported by donations to The OEIS Foundation.

 

Logo

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!)
A002145 Primes of the form 4n+3.
(Formerly M2624 N1039)
220

%I M2624 N1039

%S 3,7,11,19,23,31,43,47,59,67,71,79,83,103,107,127,131,139,151,163,167,

%T 179,191,199,211,223,227,239,251,263,271,283,307,311,331,347,359,367,

%U 379,383,419,431,439,443,463,467,479,487,491,499,503,523,547,563,571

%N Primes of the form 4n+3.

%C Or, odd primes p such that -1 is not a square mod p, i.e., the Legendre symbol (-1/p) = -1. [LeVeque I, p. 66]. - _N. J. A. Sloane_, Jun 28 2008

%C Primes which are not the sum of two squares, see the comment in A022544. - _Artur Jasinski_, Nov 15 2006

%C Natural primes which are also Gaussian primes. (It is a common error to refer to this sequence as "the Gaussian primes".)

%C Inert rational primes in the field Q(sqrt(-1)). - _N. J. A. Sloane_, Dec 25 2017

%C sin(a(n)*Pi/2) = -1 with Pi = 3.1415..., see A070750. - _Reinhard Zumkeller_, May 04 2002. (Misleading in the sense that the formula characterizes the supersequence A004767. - _R. J. Mathar_, Jul 28 2014)

%C Numbers n such that the product of coefficients of (2n)-th cyclotomic polynomial equals -1. - _Benoit Cloitre_, Oct 22 2002

%C For p and q both belonging to the sequence, exactly one of the congruences x^2 = p (mod q), x^2 = q (mod p) is solvable, according to Gauss reciprocity law. - _Lekraj Beedassy_, Jul 17 2003

%C Also primes p that divide L((p-1)/2) or L((p+1)/2), where L(n) = A000032(n), the Lucas numbers. Union of A122869 and A122870. - _Alexander Adamchuk_, Sep 16 2006

%C Also odd primes p that divide ((p-1)!! + 1) or ((p-2)!! + 1). - _Alexander Adamchuk_, Nov 30 2006

%C Also odd primes p that divide ((p-1)!! - 1) or ((p-2)!! - 1). - _Alexander Adamchuk_, Apr 18 2007

%C This sequence is a proper subset of the set of the absolute values of negative fundamental discriminants (A003657). - _Paul Muljadi_, Mar 29 2008

%C Bernard Frénicle de Bessy discovered that such primes cannot be the hypotenuse of a Pythagorean triangle in opposition to primes of the form 4*n+1 (see A002144). - after _Paul Curtz_, Sep 10 2008

%C A079261(a(n)) = 1; complement of A145395. - _Reinhard Zumkeller_, Oct 12 2008

%C Subsequence of A007970. - _Reinhard Zumkeller_, Jun 18 2011

%C A151763(a(n)) = -1.

%C Primes p such that p XOR 2 = p - 2. _Brad Clardy_, Oct 25 2011 (Misleading in the sense that this is a formula for the super-sequence A004767. - _R. J. Mathar_, Jul 28 2014)

%C It appears that each term of A004767 is the mean of two terms of this subsequence of primes therein; cf. A245203. - _M. F. Hasler_, Jul 13 2014

%C Numbers n > 2 such that ((n-2)!!)^2 == 1 (mod n). - _Thomas Ordowski_, Jul 24 2016

%C Odd numbers n > 1 such that ((n-1)!!)^2 == 1 (mod n). - _Thomas Ordowski_, Jul 25 2016

%C Primes p such that (p-2)!! == (p-3)!! (mod p). - _Thomas Ordowski_, Jul 28 2016

%C See Granville and Martin for a discussion of the relative numbers of primes of the form 4k+1 and 4k+3. - Editors, May 01 2017

%C Sometimes referred to as Blum primes for their connection to A016105 and the Blum Blum Shub generator. - _Charles R Greathouse IV_, Jun 14 2018

%D M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.

%D G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, p. 219, th. 252.

%D W. J. LeVeque, Topics in Number Theory. Addison-Wesley, Reading, MA, 2 vols., 1956, Vol. 1, p. 66.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H T. D. Noe and Zak Seidov, <a href="/A002145/b002145.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from T. D. Noe)

%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].

%H D. Alpern, <a href="http://www.alpertron.com.ar/GAUSSPR.HTM">Gaussian primes</a>

%H Lenore Blum, Manuel Blum, and Mike Shub, <a href="https://pdfs.semanticscholar.org/c19b/91cdc1da67c52e606cd4752472ce0db83131.pdf">A simple unpredictable pseudo-random number generator</a>, SIAM Journal on Computing 15:2 (1 May 1986), pp. 364-383.

%H A. Granville and G. Martin, <a href="https://arxiv.org/abs/math/0408319">Prime number races</a>, arXiv:math/0408319 [math.NT], 2004.

%H Lucas Lacasa, Bartolome Luque, Ignacio Gómez, Octavio Miramontes, <a href="https://arxiv.org/abs/1802.08349">On a Dynamical Approach to Some Prime Number Sequences</a>, Entropy 20.2 (2018): 131, also arXiv:1802.08349 [math.NT], 2018.

%H E. T. Ordman, <a href="/A002143/a002143.pdf">Tables of the class number for negative prime discriminants</a>, Deposited in Unpublished Mathematical Table file of Math. Comp. [Annotated scanned partial copy with notes]

%H H. J. Smith, <a href="http://harry-j-smith-memorial.com/GPrimes/index.html">Gaussian Primes</a>

%H I. Stewart, <a href="https://books.google.ru/books?id=I-RSVN6TjXsC&amp;printsec=frontcover&amp;dq=%22Greatest%22+ian+stewart&amp;hl=en&amp;sa=X&amp;redir_esc=y#v=onepage&amp;q=Riemann&amp;f=false">The Great Mathematical Problems</a>, 2013.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GaussianPrime.html">Gaussian Prime</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GaussianInteger.html">"Gaussian Integer"</a>.

%H Wolfram Research, <a href="http://functions.wolfram.com/NumberTheoryFunctions/JacobiSymbol/31/01/ShowAll.html">The Gauss Reciprocity Law</a>

%H <a href="/index/Ga#gaussians">Index entries for Gaussian integers and primes</a>

%H <a href="https://oeis.org/wiki/Index_to_OEIS:_Section_Pri#primes_decomp_of">Index to sequences related to decomposition of primes in quadratic fields</a>

%F Remove from A000040 terms that are in A002313.

%F Intersection of A000040 and A004767. - _Alonso del Arte_, Apr 22 2014

%p A002145 := proc(n)

%p option remember;

%p if n = 1 then

%p 3;

%p else

%p a := nextprime(procname(n-1)) ;

%p while a mod 4 <> 3 do

%p a := nextprime(a) ;

%p end do;

%p return a;

%p end if;

%p end proc:

%p seq(A002145(n),n=1..20) ; # _R. J. Mathar_, Dec 08 2011

%t Select[4Range[150] - 1, PrimeQ] (* _Alonso del Arte_, Dec 19 2013 *)

%t Select[ Prime@ Range[2, 110], Length@ PowersRepresentations[#^2, 2, 2] == 1 &] (* or *)

%t Select[ Prime@ Range[2, 110], JacobiSymbol[-1, #] == -1 &] (* _Robert G. Wilson v_, May 11 2014 *)

%o (PARI) forprime(p=2,1e3,if(p%4==3,print1(p", "))) \\ _Charles R Greathouse IV_, Jun 10 2011

%o (Haskell)

%o a002145 n = a002145_list !! (n-1)

%o a002145_list = filter ((== 1) . a010051) [3, 7 ..]

%o -- _Reinhard Zumkeller_, Aug 02 2015, Sep 23 2011

%o (MAGMA) [4*n+3 : n in [0..142] | IsPrime(4*n+3)]; // _Arkadiusz Wesolowski_, Nov 15 2013

%o (Sage)

%o A002145_list = lambda n: filter(lambda p: p % 4 == 3, list(primes(1,n))) # _Peter Luschny_, Jul 29 2014

%Y Cf. A000032, A002144, A003657, A122869, A122870. Apart from initial term, same as A045326.

%Y Cf. A016105.

%Y Cf. A004614 (multiplicative closure).

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_

%E More terms from _James A. Sellers_, Apr 21 2000

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 23:26 EST 2018. Contains 318087 sequences. (Running on oeis4.)