OFFSET
1,1
COMMENTS
This is the range of the norm a^2 + b^2 of Gaussian primes a + b i.A239621lists for each norm value a(n) one of the Gaussian primes as a, b with a >= b >= 0. InA239397,any of these (a, b) is followed by (b, a), except for a = b = 1. -Wolfdieter Lang,Mar 24 2014, edited byM. F. Hasler,Mar 09 2018
FromJean-Christophe Hervé,May 01 2013: (Start)
The present sequence is related to the square lattice, and to its division in square sublattices. Let's say that an integer n divides a lattice if there exists a sublattice of index n. Example: 2, 4, 5 divide the square lattice. ThenA001481(norms of Gaussian integers) is the sequence of divisors of the square lattice. Say that n is a "prime divisor" if the index-n sublattice is not contained in any other sublattice except the original lattice itself. The present sequence gives the "prime divisors" of the square lattice.
Similarly,A055664(Norms of Eisenstein-Jacobi primes) is the sequence of "prime divisors" of the hexagonal lattice. (End)
The sequence is formed of 2, the prime numbers of form 4k+1, and the square of other primes (of form 4k+3). These are the primitive elements ofA001481.With 0 and 1, they are the numbers that are uniquely decomposable in the sum of two squares. -Jean-Christophe Hervé,Nov 17 2013
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, A16.
L. W. Reid, The Elements of the Theory of Algebraic Numbers, MacMillan, NY, 1910, see Chap. V.
LINKS
Amiram Eldar,Table of n, a(n) for n = 1..10000(terms 1..1000 from T. D. Noe)
Eric Weisstein's World of Mathematics,Gaussian prime
Wikipedia,Table of Gaussian integer factorizations
FORMULA
Consists of 2; rational primes = 1 (mod 4) [A002144]; and squares of rational primes = 3 (mod 4) [A002145^2].
a(n) ~ 2n log n. -Charles R Greathouse IV,Feb 06 2017
EXAMPLE
There are 8 Gaussian primes of norm 5, +-1+-2i and +-2+-i, but only two inequivalent ones (2+-i). InA2396212+i is listed as 2, 1.
MATHEMATICA
Union[(#*Conjugate[#] & )[ Select[Flatten[Table[a + b*I, {a, 0, 23}, {b, 0, 23}]], PrimeQ[#, GaussianIntegers -> True] & ]]][[1;; 55]] (*Jean-François Alcover,Apr 08 2011 *)
(* Or, from formula: *) maxNorm = 569; s1 = Select[Range[1, maxNorm, 4], PrimeQ]; s3 = Select[Range[3, Sqrt[maxNorm], 4], PrimeQ]^2; Union[{2}, s1, s3] (*Jean-François Alcover,Dec 07 2012 *)
PROG
(PARI) list(lim)=my(v=List()); if(lim>=2, listput(v, 2)); forprime(p=3, sqrtint(lim\1), if(p%4==3, listput(v, p^2))); forprime(p=5, lim, if(p%4==1, listput(v, p))); Set(v) \\Charles R Greathouse IV,Feb 06 2017
(PARI) isA055025(n)=(isprime(n) && n%4<3) || (issquare(n, &n) && isprime(n) && n%4==3) \\Jianing Song,Aug 15 2023, based onCharles R Greathouse IV's program forA055664
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
N. J. A. Sloane,Jun 09 2000
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Oct 03 2000
STATUS
approved