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

A046125 Number of negative fundamental discriminants having class number n.

Original entry on oeis.org

9, 18, 16, 54, 25, 51, 31, 131, 34, 87, 41, 206, 37, 95, 68, 322, 45, 150, 47, 350, 85, 139, 68, 511, 95, 190, 93, 457, 83, 255, 73, 708, 101, 219, 103, 668, 85, 237, 115, 912, 109, 339, 106, 691, 154, 268, 107, 1365, 132, 345, 159, 770, 114, 427, 163, 1205, 179, 291
Offset: 1

Views

Author

Keywords

Examples

			a(1) = 9 because the discriminants {-3,-4,-7,-8,-11,-19,-43,-67,-163} are the only ones with class number 1.
		

Crossrefs

Programs

  • Mathematica
    FundamentalDiscriminantQ[n_] := n != 1 && (Mod[n, 4] == 1 || ! Unequal[ Mod[n, 16], 8, 12]) && SquareFreeQ[n/2^IntegerExponent[n, 2]] (* via Eric E. Weisstein *);
    k = 1; t = Table[0, {125}]; While[k < 2000001, If[ FundamentalDiscriminantQ@ -k, a = NumberFieldClassNumber@ Sqrt@ -k; If[a < 126, t[[a]]++]]; k++]; t (* Robert G. Wilson v Jun 01 2011 *)
  • PARI
    lista(nn=10^7) = {my(NMAX=100, v = vector(NMAX), c); for (k=1, nn, if (isfundamental(-k), if ((c = qfbclassno(-k)) <= NMAX, v[c] ++););); v;} \\ Michel Marcus, Feb 17 2022

Formula

From Amiram Eldar, Apr 15 2025: (Start)
Formulas from Soundararajan (2007):
Sum_{k=1..n} a(k) = (3*zeta(2)/zeta(3)) * n^2 + O(n^2 * log(n)^(-1/2+eps)).
a(n) << n^2 * log(log(n))^4 / log(n). (End)

Extensions

Edited by Robert G. Wilson v, May 13 2003
Corrected and extended by Dean Hickerson, May 20 2003. The values were obtained by transcribing and combining data from Tables 1-3 of Buell's paper, which has information for all values of n up to 125.

A191410 Class number, k, of n, i.e.; imaginary quadratic fields negated Q(sqrt(-n))=k, or 0 if n is not a fundamental discriminant (A003657).

Original entry on oeis.org

0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 2, 0, 0, 3, 2, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 2, 0, 0, 0, 4, 2, 0, 0, 1, 0, 0, 0, 5, 0, 0, 0, 2, 2, 0, 0, 4, 4, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 4, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 3, 4, 0, 0, 6, 2, 0, 0, 2, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 5, 6, 0
Offset: 1

Views

Author

Robert G. Wilson v, Jun 01 2011

Keywords

Crossrefs

a(n)= 0: n/a The complement of A003657; a(n)= 1: A014602; a(n)= 2: A014603; a(n)= 3: A006203; a(n)= 4: A013658; a(n)= 5: A046002; a(n)= 6: A046003; a(n)= 7: A046004; a(n)= 8: A046005; a(n)= 9: A046006; a(n)=10: A046007; a(n)=11: A046008; a(n)=12: A046009; a(n)=13: A046010; a(n)=14: A046011; a(n)=15: A046012; a(n)=16: A046013; a(n)=17: A046014; a(n)=18: A046015; a(n)=19: A046016; a(n)=20: A123563; a(n)=21: A046018; a(n)=22: A171724; a(n)=23: A046020; a(n)=24: A048925; a(n)=25: A056987; etc.

Programs

  • Mathematica
    FundamentalDiscriminantQ[n_] := n != 1 && (Mod[n, 4] == 1 || !Unequal[ Mod[n, 16], 8, 12]) && SquareFreeQ[n/2^IntegerExponent[n, 2]] (* via Eric E. Weisstein *);
    f[n_] := If[ !FundamentalDiscriminantQ@ -n, 0, NumberFieldClassNumber@ Sqrt@ -n]; Array[f, 105]
  • PARI
    a(n)=if(isfundamental(-n),qfbclassno(-n),0) \\ Charles R Greathouse IV, Nov 20 2012

A003640 Number of genera of imaginary quadratic field with discriminant -k, k = A003657(n).

Original entry on oeis.org

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

Views

Author

Keywords

Comments

The number of genera of a quadratic field is equal to the number of elements x in the class group such that x^2 = e where e is the identity. - Jianing Song, Jul 24 2018

References

  • D. A. Buell, Binary Quadratic Forms. Springer-Verlag, NY, 1989, pp. 224-241.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Mathematica
    okQ[n_] := n != 1 && SquareFreeQ[n/2^IntegerExponent[n, 2]] && (Mod[n, 4] == 3 || Mod[n, 16] == 8 || Mod[n, 16] == 4);
    Reap[For[n = 1, n <= 1000, n++, If[okQ[n], Sow[2^(PrimeNu[n]-1)]]]][[2, 1]] (* Jean-François Alcover, Aug 16 2019, after Andrew Howroyd *)
  • PARI
    for(n=1, 1000, if(isfundamental(-n), print1(2^(omega(n) - 1), ", "))) \\ Andrew Howroyd, Jul 24 2018
    
  • PARI
    for(n=1, 1000, if(isfundamental(-n), print1(2^#select(t->t%2==0, quadclassunit(-n).cyc), ", "))) \\ Andrew Howroyd, Jul 24 2018

Formula

a(n) = 2^(t-1) where t = number of distinct prime divisors of A003657(n).
a(n) = 2^(omega(A003657(n)) - 1).

Extensions

Name clarified and offset corrected by Jianing Song, Jul 24 2018

A191411 Class number, k, of n; i.e., imaginary quadratic fields negated Q(sqrt(-n))=k, or 0 if n is not squarefree (A005117).

Original entry on oeis.org

1, 1, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 4, 2, 0, 4, 0, 1, 0, 4, 2, 3, 0, 0, 6, 0, 0, 6, 4, 3, 0, 4, 4, 2, 0, 2, 6, 4, 0, 8, 4, 1, 0, 0, 4, 5, 0, 0, 0, 2, 0, 6, 0, 4, 0, 4, 2, 3, 0, 6, 8, 0, 0, 8, 8, 1, 0, 8, 4, 7, 0, 4, 10, 0, 0, 8, 4, 5, 0, 0, 4, 3, 0, 4, 10, 6, 0, 12, 0, 2, 0, 4, 8, 8, 0, 4, 0, 0, 0, 14, 4, 5, 0, 8
Offset: 1

Views

Author

Robert G. Wilson v, Jun 01 2011

Keywords

Crossrefs

a(n)= 0: A013929; a(n)= 1: A003173; a(n)= 2: A005847; a(n)= 3: A006203; a(n)= 4: A046085; a(n)= 5: A046002; a(n)= 6: A055109; a(n)= 7: A046004; a(n)= 8: A055110; a(n)= 9: A046006; a(n)=10: A055111; a(n)=11: A046008; a(n)=12: n/a;
a(n)=13: A046010; a(n)=14: n/a; a(n)=15: A046012; a(n)=16: n/a; a(n)=17: A046014; a(n)=18: n/a; a(n)=19: A046016;
a(n)=20: n/a; a(n)=21: A046018; a(n)=22: n/a;
a(n)=23: A046020; a(n)=24: n/a; a(n)=25: A056987; etc.
Cf. A000924 (without the zeros).

Programs

  • Mathematica
    f[n_] := If[! SquareFreeQ@ n, 0, NumberFieldClassNumber@Sqrt@ -n]; Array[f, 105]
  • PARI
    a(n) = if (! issquarefree(n), 0, qfbclassno(-n*if((-n)%4>1, 4, 1))); \\ Michel Marcus, Jul 08 2015
Showing 1-4 of 4 results.