|
|
A319662
|
|
2-rank of the class group of Q(sqrt(-k)), k squarefree.
|
|
2
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,14
|
|
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).
|
|
LINKS
|
|
|
FORMULA
|
a(n) = log_2(A003643(n)) = omega(A005117(n)) - 1, where omega(k) is the number of distinct prime divisors of k.
|
|
MATHEMATICA
|
PrimeNu[#*If[Mod[-#, 4]>1, 4, 1]] - 1& /@ Select[Range[200], SquareFreeQ] (* Jean-François Alcover, Aug 02 2019 *)
|
|
PROG
|
(PARI) for(n=1, 200, if(issquarefree(n), print1(omega(n*if((-n)%4>1, 4, 1)) - 1, ", ")))
(Sage)
L = []
for n in (1..len):
if is_squarefree(n):
if (-n) % 4 > 1: n <<= 2
return L
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|