A135462 -id:A135462 - cp's OEIS frontend

A055664 Norms of Eisenstein-Jacobi primes.

3, 4, 7, 13, 19, 25, 31, 37, 43, 61, 67, 73, 79, 97, 103, 109, 121, 127, 139, 151, 157, 163, 181, 193, 199, 211, 223, 229, 241, 271, 277, 283, 289, 307, 313, 331, 337, 349, 367, 373, 379, 397, 409, 421, 433, 439, 457, 463, 487, 499, 523, 529, 541, 547, 571

Offset: 1

N. J. A. Sloane, Jun 09 2000

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

Let us say that an integer n divides a lattice if there exists a sublattice of index n. Example: 3 divides the hexagonal lattice. Then A003136 (Loeschian numbers) is the sequence of divisors of the hexagonal 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 hexagonal lattice. Similarly, A055025 (Norms of Gaussian primes) is the sequence of "prime divisors" of the square lattice. - Jean-Christophe Hervé, Dec 04 2006

			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.

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.

T. D. Noe, Table of n, a(n) for n = 1..1000
TheGrayCuber, Eisenstein Primes Visually, Youtube video.

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

The Z[sqrt(-5)] analogs are in A020669, A091727, A091728, A091729, A091730 and A091731.

Join[{3}, Select[Range[600], (PrimeQ[#] && Mod[#, 6] == 1) || (PrimeQ[Sqrt[#]] && Mod[Sqrt[#], 3] == 2) & ]] (* Jean-François Alcover, Oct 09 2012, from formula *)

is(n)=(isprime(n) && n%3<2) || (issquare(n,&n) && isprime(n) && n%3==2) \\ Charles R Greathouse IV, Apr 30 2013

Consists of 3; rational primes == 1 (mod 3) [A002476]; and squares of rational primes == -1 (mod 3) [A003627^2].

More terms from David Wasserman, Mar 21 2002

A055667 Number of Eisenstein-Jacobi primes of norm n.

Original entry on oeis.org

0, 0, 0, 6, 6, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0

Offset: 0

N. J. A. Sloane, Jun 09 2000

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

			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.

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.

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

a[3] = 6; a[p_ /; PrimeQ[p] && Mod[p, 6] == 1] = 12; a[n_ /; PrimeQ[p = Sqrt[n]] && Mod[p, 3] == 2] = 6; a[] = 0; Table[a[n], {n, 0, 99}] (* _Jean-François Alcover, Oct 24 2013, after Franklin T. Adams-Watters *)

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

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

A295996 One quarter of number of Gaussian primes whose norm is 4*n+1 or less.

Original entry on oeis.org

0, 3, 4, 6, 8, 8, 8, 10, 10, 12, 14, 14, 15, 17, 17, 19, 19, 19, 21, 21, 21, 21, 23, 23, 25, 27, 27, 29, 31, 31, 32, 32, 32, 32, 34, 34, 34, 36, 36, 38, 38, 38, 38, 40, 40, 42, 42, 42, 44, 46, 46, 46, 46, 46, 46, 46, 46, 48, 50, 50, 52, 52, 52, 52, 54, 54, 54, 56

Offset: 0

Seiichi Manyama, Dec 02 2017

nonn

			The Gaussian primes whose norm is 9 or less;
      *        3i,
    *   *      -1+2i, 1+2i
  * *   * *    -2+i, -1+i, 1+i, 2+i
*           *  -3, 3
  * *   * *    -2-i, -1-i, 1-i, 2-i
    *   *      -1-2i, 1-2i
      *        -3i
               a(2) = 16/4 = 4.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Gaussian Prime

Cf. A016813, A055029, A091100, A091134, A135462, A296020, A296021.

require 'prime'
def A(k, n)
  ary = []
  cnt = 0
  k.step(4 * n + k, 4){|i|
    cnt += 1 if i.prime?
    ary << cnt
  }
  ary
end
def A295996(n)
  ary1 = A(1, n)
  ary3 = A(3, Math.sqrt(n).to_i) + [0]
  [0] + (1..n).map{|i| 1 + 2 * ary1[i] + ary3[(Math.sqrt(4 * i + 1).to_i - 3) / 4]}
end
p A295996(100)

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

N. J. A. Sloane, Feb 06 2008

nonn

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

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

Antti Karttunen, Table of n, a(n) for n = 0..65537
Index entries for characteristic functions

Cf. A055667, A135462.

Characteristic function of A055664.

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 *)

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

cp's OEIS Frontend

A055664 Norms of Eisenstein-Jacobi primes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A055667 Number of Eisenstein-Jacobi primes of norm n.

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Mathematica

Formula

Extensions

A295996 One quarter of number of Gaussian primes whose norm is 4*n+1 or less.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Ruby

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

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI