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.

A317991 2-rank of the narrow class group of real quadratic field with discriminant A003658(n), n >= 2.

Original entry on oeis.org

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

Views

Author

Jianing Song, Oct 03 2018

Keywords

Comments

The p-rank of a finite abelian group G is equal to log_p(#{x belongs to G : x^p = 1}) where p is a prime number. In this case, G is the narrow class group of Q(sqrt(k)) or the form class group of indefinite binary quadratic forms with discriminant k, and #{x belongs to G : x^p = 1} is the number of genera of Q(sqrt(k)) (cf. A317989).
This is the analog of A319659 for real quadratic fields.

Crossrefs

Programs

  • Mathematica
    PrimeNu[Select[Range[2, 300], NumberFieldDiscriminant[Sqrt[#]] == #&]] - 1 (* Jean-François Alcover, Jul 25 2019 *)
  • PARI
    for(n=2, 1000, if(isfundamental(n), print1(omega(n) - 1, ", ")))

Formula

a(n) = omega(A003658(n)) - 1 = log_2(A317989(n)), where omega(k) is the number of distinct prime divisors of k.

Extensions

Offset corrected by Jianing Song, Mar 31 2019

A319660 2-rank of the class group of imaginary quadratic field with discriminant -k, k = A039957(n).

Original entry on oeis.org

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

Views

Author

Jianing Song, Sep 25 2018

Keywords

Comments

The p-rank of a finite abelian group G is equal to log_p(#{x belongs to G : x^p = 1}) where p is a prime number. In this case, G is the class group of Q(sqrt(-k)), and #{x belongs to G : x^p = 1} is the number of genera of Q(sqrt(-k)) (cf. A003641).

Crossrefs

Programs

  • PARI
    for(n=1, 1000, if(n%4==3 && issquarefree(n), print1(omega(n) - 1, ", ")))

Formula

a(n) = log_2(A003641(n)) = omega(A039957(n)) - 1, where omega(k) is the number of distinct prime divisors of k.

A319661 2-rank of the class group of imaginary quadratic field with discriminant -k, k = A191483(n).

Original entry on oeis.org

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

Views

Author

Jianing Song, Sep 25 2018

Keywords

Comments

The p-rank of a finite abelian group G is equal to log_p(#{x belongs to G : x^p = 1}) where p is a prime number. In this case, G is the class group of Q(sqrt(-k)), and #{x belongs to G : x^p = 1} is the number of genera of Q(sqrt(-k)) (cf. A003642).

Crossrefs

Programs

  • Mathematica
    PrimeNu[Select[Range[1000], Mod[#, 4] == 0 && SquareFreeQ[#/4] && Mod[#, 16] != 12&]] - 1 (* Jean-François Alcover, Aug 02 2019, after Andrew Howroyd in A191483 *)
  • PARI
    for(n=1, 1000, if(isfundamental(-n) && n%2==0, print1(omega(n) - 1, ", ")))
    
  • Sage
    def A319661_list(len):
        L = []
        for n in range(2, len+1, 2):
            if is_fundamental_discriminant(-n):
                L.append(sloane.A001221(n) - 1)
        return L
    print(A319661_list(854)) # Peter Luschny, Oct 15 2018

Formula

a(n) = log_2(A003642(n)) = omega(A191483(n)) - 1, where omega(k) is the number of distinct prime divisors of k.

A319662 2-rank of the class group of Q(sqrt(-k)), k squarefree.

Original entry on oeis.org

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

Views

Author

Jianing Song, Sep 25 2018

Keywords

Comments

The p-rank of a finite abelian group G is equal to log_p(#{x belongs to G : x^p = 1}) where p is a prime number. In this case, G is the class group of Q(sqrt(-k)), and #{x belongs to G : x^p = 1} is the number of genera of Q(sqrt(-k)) (cf. A003643).

Crossrefs

Real discriminant case: A317992.

Programs

  • Mathematica
    PrimeNu[#*If[Mod[-#, 4]>1, 4, 1]] - 1& /@ Select[Range[200], SquareFreeQ] (* Jean-François Alcover, Aug 02 2019 *)
  • PARI
    for(n=1, 200, if(issquarefree(n), print1(omega(n*if((-n)%4>1, 4, 1)) - 1, ", ")))
    
  • Sage
    def A319662_list(len):
        L = []
        for n in (1..len):
            if is_squarefree(n):
                if (-n) % 4 > 1: n <<= 2
                L.append(sloane.A001221(n) - 1)
        return L
    print(A319662_list(141)) # Peter Luschny, Oct 15 2018

Formula

a(n) = log_2(A003643(n)) = omega(A005117(n)) - 1, where omega(k) is the number of distinct prime divisors of k.
Showing 1-4 of 4 results.