cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 26 results. Next

A055666 Number of inequivalent Eisenstein-Jacobi primes of successive norms (indexed by A055664).

Original entry on oeis.org

1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
Offset: 1

Views

Author

N. J. A. Sloane, Jun 09 2000

Keywords

Comments

These are the primes in the ring of integers a+b*omega, a and b rational integers, omega = (1+sqrt(-3))/2.
Two primes are considered equivalent if they differ by multiplication by a unit (+-1, +-omega, +-omega^2).

Examples

			There are 6 Eisenstein-Jacobi primes of norm 3, omega-omega^2 times one of the 6 units [ +-1, +-omega, +-omega^2 ] but only one up to equivalence.
		

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. VI.

Crossrefs

Cf. A055664-A055668, A055025-A055029. See A004016 and A035019 for theta series of Eisenstein (or hexagonal) lattice.

Programs

  • Mathematica
    norms = Join[{3}, Select[Range[2000], (PrimeQ[#] && Mod[#, 6] == 1) || (PrimeQ[Sqrt[#]] && Mod[Sqrt[#], 3] == 2) &]]; r[n_] := Length[Reduce[n == a^2 - a*b + b^2, {a, b}, Integers]]/6; A055666 = r /@ norms (* Jean-François Alcover, Oct 24 2013 *)

Extensions

More terms from Franklin T. Adams-Watters, May 05 2006

A055665 Number of Eisenstein-Jacobi primes of successive norms (indexed by A055664).

Original entry on oeis.org

6, 6, 12, 12, 12, 6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12
Offset: 1

Views

Author

N. J. A. Sloane, Jun 09 2000

Keywords

Comments

These are the primes in the ring of integers a+b*omega, a and b rational integers, omega = (1+sqrt(-3))/2.

Examples

			There are 6 Eisenstein-Jacobi primes of norm 3, omega-omega^2 times one of the 6 units [ +-1, +-omega, +-omega^2 ] but only one up to equivalence.
		

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. VI.

Crossrefs

Cf. A055664-A055668, A055025-A055029. See A004016 and A035019 for theta series of Eisenstein (or hexagonal) lattice.

Programs

  • Mathematica
    norms = Join[{3}, Select[Range[1000], (PrimeQ[#] && Mod[#, 6] == 1) || (PrimeQ[Sqrt[#]] && Mod[Sqrt[#], 3] == 2) &]]; r[n_] := Reduce[n == a^2 - a*b + b^2, {a, b}, Integers] // Length; A055665 = r /@ norms (* Jean-François Alcover, Oct 24 2013 *)

Formula

a(n) = 6 * A055666(n) - Franklin T. Adams-Watters, May 05 2006

Extensions

More terms from Franklin T. Adams-Watters, May 05 2006

A135461 a(n) = 1 if n is the norm of an Eisenstein prime (see A055664) otherwise 0.

Original entry on oeis.org

0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0
Offset: 0

Views

Author

N. J. A. Sloane, Feb 06 2008

Keywords

Examples

			The smallest primes are 1-omega (of norm 3) and 2 (of norm 4).
		

References

  • L. W. Reid, The Elements of the Theory of Algebraic Numbers, MacMillan, NY, 1910, see Chap. VI.

Crossrefs

Characteristic function of A055664.

Programs

  • Mathematica
    f[n_]:=If[ PrimeQ[n] && Mod[n, 6] == 1|| PrimeQ[Sqrt[n]] && Mod[Sqrt[n], 3] == 2||n==3,1,0];Array[f,99,0] (* James C. McMahon, Apr 15 2025 *)
  • PARI
    A135461(n) = (isprime(n) && n%3<2) || (issquare(n, &n) && isprime(n) && n%3==2); \\ This is Charles R Greathouse IV's Apr 30 2013 code (with name "is") for A055664. - Antti Karttunen, Dec 06 2017

A135462 a(n) = number of Eisenstein primes (see A055664) of norm <= n.

Original entry on oeis.org

0, 0, 0, 6, 12, 12, 12, 24, 24, 24, 24, 24, 24, 36, 36, 36, 36, 36, 36, 48, 48, 48, 48, 48, 48, 54, 54, 54, 54, 54, 54, 66, 66, 66, 66, 66, 66, 78, 78, 78, 78, 78, 78, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 102, 102, 102, 102, 102
Offset: 0

Views

Author

N. J. A. Sloane, Feb 06 2008

Keywords

References

  • L. W. Reid, The Elements of the Theory of Algebraic Numbers, MacMillan, NY, 1910, see Chap. VI.

Crossrefs

Programs

  • Mathematica
    A055667[n_] := Which[n == 3, 6, PrimeQ[n] && Mod[n, 6] == 1, 12, PrimeQ[p = Sqrt[n]] && Mod[p, 3] == 2, 6, True, 0]; Accumulate[Array[A055667, 66, 0]] (* Jean-François Alcover, Feb 28 2018 *)

Formula

a(n) = a(n-1) + A055667(n) for n > 0. - Seiichi Manyama, Dec 09 2017

Extensions

Terms corrected by Seiichi Manyama, Dec 09 2017

A055025 Norms of Gaussian primes.

Original entry on oeis.org

2, 5, 9, 13, 17, 29, 37, 41, 49, 53, 61, 73, 89, 97, 101, 109, 113, 121, 137, 149, 157, 173, 181, 193, 197, 229, 233, 241, 257, 269, 277, 281, 293, 313, 317, 337, 349, 353, 361, 373, 389, 397, 401, 409, 421, 433, 449, 457, 461, 509, 521, 529, 541, 557, 569
Offset: 1

Views

Author

N. J. A. Sloane, Jun 09 2000

Keywords

Comments

This is the range of the norm a^2 + b^2 of Gaussian primes a + b i. A239621 lists for each norm value a(n) one of the Gaussian primes as a, b with a >= b >= 0. In A239397, any of these (a, b) is followed by (b, a), except for a = b = 1. - Wolfdieter Lang, Mar 24 2014, edited by M. F. Hasler, Mar 09 2018
From Jean-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. Then A001481 (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 of A001481. With 0 and 1, they are the numbers that are uniquely decomposable in the sum of two squares. - Jean-Christophe Hervé, Nov 17 2013

Examples

			There are 8 Gaussian primes of norm 5, +-1+-2i and +-2+-i, but only two inequivalent ones (2+-i). In A239621 2+i is listed as 2, 1.
		

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.

Crossrefs

Cf. A239397, A239621 (Gaussian primes).

Programs

  • 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 *)
  • 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 on Charles R Greathouse IV's program for A055664

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

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Oct 03 2000

A055029 Number of inequivalent Gaussian primes of norm n.

Original entry on oeis.org

0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0
Offset: 0

Views

Author

N. J. A. Sloane, Jun 09 2000

Keywords

Comments

These are the primes in the ring of integers a+bi, a and b rational integers, i = sqrt(-1).
Two primes are considered equivalent if they differ by multiplication by a unit (+-1, +-i).

Examples

			There are 8 Gaussian primes of norm 5, +-1+-2i and +-2+-i, but only two inequivalent ones (2+-i).
		

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.

Crossrefs

Programs

Formula

a(n) = A055028(n)/4.
a(n) = 2 if n is a prime = 1 (mod 4); a(n) = 1 if n is 2, or p^2 where p is a prime = 3 (mod 4); a(n) = 0 otherwise. - Franklin T. Adams-Watters, May 05 2006
a(n) = if n = 2 then 1 else 2*A079260(n) + A079261(A037213(n)). - Reinhard Zumkeller, Nov 11 2012

Extensions

More terms from Reiner Martin, Jul 20 2001

A345435 Represent the ring of Eisenstein integers E = {x+y*omega: x, y rational integers, omega = exp(2*Pi*i/3)} by the cells of a hexagonal grid; number the cells of the grid along a counterclockwise hexagonal spiral, with the cells 0, 1 numbered 0, 1. Sequence lists the index numbers of the cells which are 0 or a prime in E.

Original entry on oeis.org

0, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 26, 28, 29, 31, 32, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 62, 63, 65, 67, 68, 70, 72, 73, 75, 77, 78, 80, 82, 83, 85, 87, 88, 90, 91, 95, 97, 101, 103, 107, 109, 113, 115
Offset: 1

Views

Author

N. J. A. Sloane, Jun 23 2021

Keywords

Comments

The Eisenstein integer represented by cell m is A307013(m) + A307012(m)*omega. Thus the set of Eisenstein primes is {A307013(a(n)) + A307012(a(n))*omega : n >= 2}. - Peter Munn, Jun 26 2021
The Eisenstein integer a + b*omega has norm a^2 - a*b + b^2 (see A003136). The number of Eisenstein integers of norm n is given by A004016(n).
The norms of the Eisenstein primes are given in A055664, and the number of Eisenstein primes of norm n is given in A055667.
Reid's 1910 book (still in print) is still the best reference for the Eisenstein integers and similar rings.

Examples

			The smallest Eisenstein integers are 0 (of norm 0), and the six units of norm 1, namely (writing w for omega) +-1, +-w, +-w^2.
The first few Eisenstein primes are (here u is any of the six units):
   u*(2+w), norm = 3, number = 6;
   2*u, norm = 4, number = 6;
   u*(3+w), norm = 7, number = 6;
   u*(3+2*w), norm = 7, number = 6 (so there are 12 primes of norm 7 - see A055667).
		

References

  • J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag; Table 4.4, p. 111.
  • L. W. Reid, The Elements of the Theory of Algebraic Numbers, MacMillan, NY, 1910, see Chap. VI.
  • H. M. Stark, An Introduction to Number Theory. Markham, Chicago, 1970; Theorem 8.22 on page 295 lists the nine UFDs of the form Q(sqrt(-d)), cf. A003173.

Crossrefs

Programs

  • PARI
    See Links section.

Extensions

More terms from Rémy Sigrist, Jun 26 2021

A091727 Norms of prime ideals of Z[sqrt(-5)].

Original entry on oeis.org

2, 3, 5, 7, 23, 29, 41, 43, 47, 61, 67, 83, 89, 101, 103, 107, 109, 121, 127, 149, 163, 167, 169, 181, 223, 227, 229, 241, 263, 269, 281, 283, 289, 307, 347, 349, 361, 367, 383, 389, 401, 409, 421, 443, 449, 461, 463, 467, 487
Offset: 1

Views

Author

Paul Boddington, Feb 02 2004

Keywords

Comments

Consists of primes congruent to 1, 2, 3, 5, 7, 9 (mod 20) together with the squares of all other primes.
From Jianing Song, Feb 20 2021: (Start)
The norm of a nonzero ideal I in a ring R is defined as the size of the quotient ring R/I.
Note that Z[sqrt(-5)] has class number 2.
For primes p == 1, 9 (mod 20), there are two distinct ideals with norm p in Z[sqrt(-5)], namely (x + y*sqrt(-5)) and (x - y*sqrt(-5)), where (x,y) is a solution to x^2 + 5*y^2 = p.
For p == 3, 7 (mod 20), there are also two distinct ideals with norm p, namely (p, x+y*sqrt(-5)) and (p, x-y*sqrt(-5)), where (x,y) is a solution to x^2 + 5*y^2 = p^2 with y != 0; (2, 1+sqrt(-5)) and (sqrt(-5)) are respectively the unique ideal with norm 2 and 5.
For p == 11, 13, 17, 19 (mod 20), (p) is the only ideal with norm p^2. (End)

Examples

			From _Jianing Song_, Feb 20 2021: (Start)
Let |I| be the norm of an ideal I, then:
|(2, 1+sqrt(-5))| = 2;
|(3, 2+sqrt(-5))| = |(3, 2-sqrt(-5))| = 3;
|(sqrt(-5))| = 5;
|(7, 1+3*sqrt(-5))| = |(7, 1-3*sqrt(-5))| = 7;
|(23, 22+3*sqrt(-5))| = |(23, 22-3*sqrt(-5))| = 23;
|(3 + 2*sqrt(-5))| = |(3 - 2*sqrt(-5))| = 29;
|(6 + sqrt(-5))| = |(6 - sqrt(-5))| = 41. (End)
		

References

  • David A. Cox, Primes of the form x^2+ny^2, Wiley, 1989.
  • A. Frohlich and M. J. Taylor, Algebraic number theory, Cambridge university press, 1991.

Crossrefs

Cf. A091728.
The number of distinct ideals with norm n is given by A035170.
Norms of prime ideals in O_K, where K is the quadratic field with discriminant D and O_K be the ring of integers of K: A055673 (D=8), A341783 (D=5), A055664 (D=-3), A055025 (D=-4), A090348 (D=-7), A341784 (D=-8), A341785 (D=-11), A341786 (D=-15*), A341787 (D=-19), this sequence (D=-20*), A341788 (D=-43), A341789 (D=-67), A341790 (D=-163). Here a "*" indicates the cases where O_K is not a unique factorization domain.

Programs

  • PARI
    isA091727(n) = { my(ms = [1, 2, 3, 5, 7, 9], p, e=isprimepower(n,&p)); if(!e || e>2, 0, bitxor(e-1,!!vecsearch(ms,p%20))); }; \\ Antti Karttunen, Feb 24 2020

Extensions

Offset corrected by Jianing Song, Feb 20 2021

A341784 Norms of prime elements in Z[sqrt(-2)], the ring of integers of Q(sqrt(-2)).

Original entry on oeis.org

2, 3, 11, 17, 19, 25, 41, 43, 49, 59, 67, 73, 83, 89, 97, 107, 113, 131, 137, 139, 163, 169, 179, 193, 211, 227, 233, 241, 251, 257, 281, 283, 307, 313, 331, 337, 347, 353, 379, 401, 409, 419, 433, 443, 449, 457, 467, 491, 499, 521, 523, 529, 547, 563
Offset: 1

Views

Author

Jianing Song, Feb 19 2021

Keywords

Comments

Also norms of prime ideals in Z[sqrt(-2)], which is a unique factorization domain. The norm of a nonzero ideal I in a ring R is defined as the size of the quotient ring R/I.
Consists of the primes congruent to 1, 2, 3 modulo 8 and the squares of primes congruent to 5, 7 modulo 8.
For primes p == 1, 3 (mod 8), there are two distinct ideals with norm p in Z[sqrt(2)], namely (x + y*sqrt(-2)) and (x - y*sqrt(-2)), where (x,y) is a solution to x^2 + 2*y^2 = p; for p = 2, (sqrt(-2)) is the unique ideal with norm p; for p == 5, 7 (mod 8), (p) is the only ideal with norm p^2.

Examples

			norm(1 + sqrt(-2)) = norm(1 + sqrt(-2)) = 3;
norm(3 + sqrt(-2)) = norm(3 + sqrt(-2)) = 11;
norm(3 + 2*sqrt(-2)) = norm(3 + 2*sqrt(-2)) = 17;
norm(1 + 3*sqrt(-2)) = norm(1 + 3*sqrt(-2)) = 19.
		

Crossrefs

The number of nonassociative elements with norm n (also the number of distinct ideals with norm n) is given by A002325.
The total number of elements with norm n is given by A033715.
Norms of prime ideals in O_K, where K is the quadratic field with discriminant D and O_K be the ring of integers of K: A055673 (D=8), A341783 (D=5), A055664 (D=-3), A055025 (D=-4), A090348 (D=-7), this sequence (D=-8), A341785 (D=-11), A341786 (D=-15*), A341787 (D=-19), A091727 (D=-20*), A341788 (D=-43), A341789 (D=-67), A341790 (D=-163). Here a "*" indicates the cases where O_K is not a unique factorization domain.

Programs

  • PARI
    isA341784(n) = my(disc=-8); (isprime(n) && kronecker(disc,n)>=0) || (issquare(n, &n) && isprime(n) && kronecker(disc,n)==-1)

A341785 Norms of prime elements in Z[(1+sqrt(-11))/2], the ring of integers of Q(sqrt(-11)).

Original entry on oeis.org

3, 4, 5, 11, 23, 31, 37, 47, 49, 53, 59, 67, 71, 89, 97, 103, 113, 137, 157, 163, 169, 179, 181, 191, 199, 223, 229, 251, 257, 269, 289, 311, 313, 317, 331, 353, 361, 367, 379, 383, 389, 397, 401, 419, 421, 433, 443, 449, 463, 467, 487, 499, 509, 521
Offset: 1

Views

Author

Jianing Song, Feb 19 2021

Keywords

Comments

Also norms of prime ideals in Z[(1+sqrt(-11))/2], which is a unique factorization domain. The norm of a nonzero ideal I in a ring R is defined as the size of the quotient ring R/I.
Consists of the primes congruent to 0, 1, 3, 4, 5, 9 modulo 11 and the squares of primes congruent to 2, 6, 7, 8, 10 modulo 5.
For primes p == 1, 3, 4, 5, 9 (mod 11), there are two distinct ideals with norm p in Z[(1+sqrt(-11))/2], namely (x + y*(1+sqrt(-11))/2) and (x + y*(1-sqrt(-11))/2), where (x,y) is a solution to x^2 + x*y + 3*y^2 = p; for p = 11, (sqrt(-11)) is the unique ideal with norm p; for p == 2, 6, 7, 8, 10 (mod 11), (p) is the only ideal with norm p^2.

Examples

			norm((1 + sqrt(-11))/2) = norm((1 - sqrt(-11))/2) = 3;
norm((3 + sqrt(-11))/2) = norm((3 - sqrt(-11))/2) = 5;
norm((9 + sqrt(-11))/2) = norm((9 - sqrt(-11))/2) = 23;
norm((5 + 3*sqrt(-11))/2) = norm((5 - 3*sqrt(-11))/2) = 31.
		

Crossrefs

The number of nonassociative elements with norm n (also the number of distinct ideals with norm n) is given by A035179.
The total number of elements with norm n is given by A028609.
Norms of prime ideals in O_K, where K is the quadratic field with discriminant D and O_K be the ring of integers of K: A055673 (D=8), A341783 (D=5), A055664 (D=-3), A055025 (D=-4), A090348 (D=-7), A341784 (D=-8), this sequence (D=-11), A341786 (D=-15*), A341787 (D=-19), A091727 (D=-20*), A341788 (D=-43), A341789 (D=-67), A341790 (D=-163). Here a "*" indicates the cases where O_K is not a unique factorization domain.

Programs

  • PARI
    isA341785(n) = my(disc=-11); (isprime(n) && kronecker(disc,n)>=0) || (issquare(n, &n) && isprime(n) && kronecker(disc,n)==-1)
Showing 1-10 of 26 results. Next