|
%I M0051 #31 Apr 14 2019 10:40:59
%S 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,2,1,2,1,1,1,1,2,1,1,1,1,1,1,2,2,1,
%T 1,2,1,1,1,2,1,2,1,4,1,1,2,1,1,2,2,1,1,1,1,1,2,1,1,1,1,2,2,1,1,1,2,2,
%U 3,2,1,1,1,1,1,1,1,3,2,2,1,1,2,1,2,1,1,2,1,2,1,2,1,2,1,3,1,3,4,1,1,1,1,1,2
%N Class number of real quadratic field with discriminant A003658(n), n >= 2.
%D D. A. Buell, Binary Quadratic Forms. Springer-Verlag, NY, 1989, pp. 224-241.
%D H. Cohen, A Course in Computational Algebraic Number Theory, Springer, 1993, pp. 515-519
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A003652/b003652.txt">Table of n, a(n) for n = 2..3001</a>
%H S. R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/">Class number theory</a>
%H Steven R. Finch, <a href="/A000924/a000924.pdf">Class number theory</a> [Cached copy, with permission of the author]
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ClassNumber.html">Class Number</a>
%t NumberFieldClassNumber[Sqrt[#]] &/@ Select[Range[500], FundamentalDiscriminantQ] (* _G. C. Greubel_, Mar 01 2019 *)
%o (PARI) for(n=1, 500, if(isfundamental(n) && !issquare(n), print1(quadclassunit(n).no, ", "))) \\ _G. C. Greubel_, Mar 01 2019
%o (Sage) [QuadraticField(n, 'a').class_number() for n in (1..500) if is_fundamental_discriminant(n) and not is_square(n)] # _G. C. Greubel_, Mar 01 2019
%K nonn
%O 2,12
%A _N. J. A. Sloane_, _Mira Bernstein_
%E Offset corrected by _Jianing Song_, Mar 31 2019
|
