|
|
A317989
|
|
Number of genera of real quadratic field with discriminant A003658(n), n >= 2.
|
|
2
|
|
|
1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 4, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 1, 2, 4, 1, 1, 4, 2, 2, 2, 2, 1, 4, 2, 2, 1, 2, 4, 1, 2, 4, 4, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 4, 2, 2, 2, 2, 4, 2, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 4, 2, 2, 1, 4, 1, 4, 1, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,3
|
|
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.
This is the analog of A003640 for real quadratic fields. Note that for this case "the class group" refers to the narrow class group, or the form class group of indefinite binary quadratic forms with discriminant k.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2^(omega(A003658(n)-1)) = 2^A317991(n), where omega(k) is the number of distinct prime divisors of k.
|
|
MATHEMATICA
|
2^(PrimeNu[Select[Range[2, 300], NumberFieldDiscriminant[Sqrt[#]]==#&]] - 1) (* Jean-François Alcover, Jul 25 2019 *)
|
|
PROG
|
(PARI) for(n=2, 1000, if(isfundamental(n), print1(2^(omega(n) - 1), ", ")))
(PARI) for(n=2, 1000, if(isfundamental(n), print1(2^#select(t->t%2==0, quadclassunit(n).cyc), ", ")))
(Sage)
L = (sloane.A001221(n) for n in (1..len) if is_fundamental_discriminant(n))
return [2^(l-1) for l in L]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|