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-3 of 3 results.

A003173 Heegner numbers: imaginary quadratic fields with unique factorization (or class number 1).

Original entry on oeis.org

1, 2, 3, 7, 11, 19, 43, 67, 163
Offset: 1

Views

Author

Keywords

Comments

Could also be called Gauss numbers, since he discovered them. Heegner proved list is complete. - Artur Jasinski, Mar 21 2003
Numbers n such that Q(sqrt(-n)) has unique factorization into primes.
These are the squarefree values of n for which if some positive integer N can be written in the form (a/2)^2+n*(b/2)^2 for integers a and b, then every prime factor P of N which occurs to an odd power can also be written in the form (c/2)^2+n*(d/2)^2 for integers c and d. - V. Raman, Sep 17 2012, May 01 2013
Cases n = 1 and n = 2 correspond to the rings Z[i] (Gaussian integers) and Z[sqrt(-2)] = numbers of the form a + b*sqrt(-2), where a and b are integers. Other cases, satisfying a(n) == 3 (mod 4), correspond to the rings of numbers of the form (a/2) + (b/2)*sqrt(-a(n)), for integers a and b of the same parity. All these rings admit unique factorization. - V. Raman, Sep 17 2012, corrected by Eric M. Schmidt, Feb 17 2013
The Heegner numbers greater than 3 can also be found using the Kronecker symbol, as follows: A number k > 3 is a Heegner number if and only if s = Sum_{j = 1..k} j * (j|k) is prime, which happens to be negative, where (x|y) is the Kronecker symbol. Also note for these results s = -k. But if s = -k is used as the selection condition (instead of primality), then the cubes of {7, 11, 19, 43, 67, 163} are also selected, followed by these same numbers to 9th power (and presumably followed by the 27th or 81st power). - Richard R. Forberg, Jul 18 2016
Theorem: The ring of integers of the imaginary quadratic field Q(sqrt(-n)) is Euclidean iff n = 1, 2, 3, 7 and 11. (Otherwise, the ring of integers of the imaginary quadratic field Q(sqrt(-n)) is principal iff n is a term of this sequence) [Link Stark-Heegner theorem]. - Bernard Schott, Feb 07 2020
Named after the German high school teacher and radio engineer Kurt Heegner (1893-1965). - Amiram Eldar, Jun 15 2021

References

  • John H. Conway and Richard K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 224.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, p. 213.
  • Wilfred W. J. Hulsbergen, Conjectures in Arithmetic Algebraic Geometry, Vieweg, 1994, p. 8.
  • Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 143.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • Harold M. Stark, An Introduction to Number Theory. Markham, Chicago, 1970, p. 295.

Crossrefs

Cf. A003174, A005847 (for class number 2), A014602 (for discriminants of these fields), A048981, A263465.

Programs

  • Mathematica
    Union[ Select[ -NumberFieldDiscriminant[ Sqrt[-#]]& /@ Range[200], NumberFieldClassNumber[ Sqrt[-#]] == 1 & ] /. {4 -> 1, 8 -> 2}] (* Jean-François Alcover, Jan 04 2012 *)
    heegnerNums = {}; Do[s = Sum[j * KroneckerSymbol[j, k], {j, 1, k}]; If[PrimeQ[s], AppendTo[heegnerNums, {s, k}]], {k, 1, 10000}]; heegnerNums (* Richard R. Forberg, Jul 18 2016 *)
  • PARI
    select(n->qfbclassno(-n*if(n%4==3,1,4))==1, vector(200,i,i)) \\ Charles R Greathouse IV, Nov 20 2012

Formula

a(n) = A263465(n) = -A048981(6-n) for n <= 5. - Jonathan Sondow, May 28 2016

A003174 Positive integers D such that Q[sqrt(D)] is a quadratic field which is norm-Euclidean.

Original entry on oeis.org

2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, 73
Offset: 1

Views

Author

Keywords

Comments

These integers yield norm-Euclidean real quadratic fields. There are other positive integers, e.g., D=14 or D=69, for which Q[sqrt(D)] is Euclidean, but for a Euclidean function different from the field norm.
For further references see sequence A048981 which also lists negative D corresponding to (complex) norm-Euclidean fields. - M. F. Hasler, Jan 26 2014

References

  • H. Cohn, A Second Course in Number Theory, Wiley, NY, 1962, p. 109.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 213.
  • K. Inkeri, Über den Euklidischen Algorithmus in quadratischen Zahlkörpern. Ann. Acad. Sci. Fennicae Ser. A. 1. Math.-Phys., No. 41, 1-35, 1947. [Incorrectly gives 97 as a member of this sequence.]
  • W. J. LeVeque, Topics in Number Theory. Addison-Wesley, Reading, MA, 2 vols., 1956, Vol. 2, p. 57.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • H. M. Stark, An Introduction to Number Theory. Markham, Chicago, 1970, p. 294.

Crossrefs

Programs

Formula

a(n) = A048981(n+5). - M. F. Hasler, Jan 26 2014

Extensions

Definition corrected and comment rephrased by M. F. Hasler, Jan 26 2014
Definition corrected by Jonathan Sondow, Oct 19 2015

A048981 Squarefree values of n for which the quadratic field Q[ sqrt(n) ] is norm-Euclidean.

Original entry on oeis.org

-11, -7, -3, -2, -1, 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 57, 73
Offset: 1

Views

Author

Keywords

Comments

These are norm-Euclidean fields, excluding for instance Q[sqrt(69)] which is Euclidean but not for norm. - Marc A. A. van Leeuwen, Feb 15 2011

References

  • H. Cohn, A Second Course in Number Theory, Wiley, NY, 1962, pp. 107, 109.
  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 213.
  • K. Inkeri, Über den Euklidischen Algorithmus in quadratischen Zahlkörpern. Ann. Acad. Sci. Fennicae Ser. A. 1. Math.-Phys., No. 41, 1-35, 1947. [Incorrectly gives 97 as a member of this sequence.]
  • W. J. LeVeque, Topics in Number Theory. Addison-Wesley, Reading, MA, 2 vols., 1956, Vol. 2, p. 57.
  • H. M. Stark, An Introduction to Number Theory. Markham, Chicago, 1970, p. 294.

Crossrefs

Programs

  • Maple
    select(t -> traperror(numtheory:-factorEQ(-1,t)) <> lasterror, [$-11..77]); # Robert Israel, Jul 20 2016

Formula

a(n) = -A003173(6-n) = -A263465(6-n) for n = 1, 2, 3, 4, 5. - Jonathan Sondow, Dec 09 2015

Extensions

Name corrected by Marc A. A. van Leeuwen, Feb 15 2011
Showing 1-3 of 3 results.