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.

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

This page as a plain text file.
%I A319662 #29 Feb 24 2021 08:17:37
%S A319662 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,
%T A319662 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,
%U A319662 2,1,1,2,1,1,1,1,1,0,2,2,0,2,1,1,2,0,2
%N A319662 2-rank of the class group of Q(sqrt(-k)), k squarefree.
%C A319662 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).
%H A319662 Rick L. Shepherd, <a href="https://libres.uncg.edu/ir/uncg/listing.aspx?id=15057">Binary quadratic forms and genus theory</a>, Master of Arts Thesis, University of North Carolina at Greensboro, 2013.
%F A319662 a(n) = log_2(A003643(n)) = omega(A005117(n)) - 1, where omega(k) is the number of distinct prime divisors of k.
%t A319662 PrimeNu[#*If[Mod[-#, 4]>1, 4, 1]] - 1& /@ Select[Range[200], SquareFreeQ] (* _Jean-François Alcover_, Aug 02 2019 *)
%o A319662 (PARI) for(n=1, 200, if(issquarefree(n), print1(omega(n*if((-n)%4>1, 4, 1)) - 1, ", ")))
%o A319662 (Sage)
%o A319662 def A319662_list(len):
%o A319662     L = []
%o A319662     for n in (1..len):
%o A319662         if is_squarefree(n):
%o A319662             if (-n) % 4 > 1: n <<= 2
%o A319662             L.append(sloane.A001221(n) - 1)
%o A319662     return L
%o A319662 print(A319662_list(141)) # _Peter Luschny_, Oct 15 2018
%Y A319662 Cf. A000924, A003643, A005117, A033197, A319659.
%Y A319662 Real discriminant case: A317992.
%K A319662 nonn
%O A319662 1,14
%A A319662 _Jianing Song_, Sep 25 2018