cp's OEIS Frontend

A079896 Discriminants of indefinite binary quadratic forms.

%I A079896 #59 Jun 07 2025 08:14:16
%S A079896 5,8,12,13,17,20,21,24,28,29,32,33,37,40,41,44,45,48,52,53,56,57,60,
%T A079896 61,65,68,69,72,73,76,77,80,84,85,88,89,92,93,96,97,101,104,105,108,
%U A079896 109,112,113,116,117,120,124,125,128,129,132,133,136,137,140,141,145,148
%N A079896 Discriminants of indefinite binary quadratic forms.
%C A079896 Numbers n such that n == 0 (mod 4) or n == 1 (mod 4), but n is not a square.
%C A079896 For an indefinite binary quadratic form over the integers a*x^2 + b*x*y + c*y^2 the discriminant is D = b^2 - 4*a*c > 0; and D not a square is assumed.
%C A079896 Also, a superset of A227453. - _Ralf Stephan_, Sep 22 2013
%C A079896 For the period length of the continued fraction of sqrt(a(n)) see A267857(n). - _Wolfdieter Lang_, Feb 18 2016
%C A079896 [I changed the offset to 1, since this is an important list. Many parts of the entry, including the b-file, will need to be changed. - _N. J. A. Sloane_, Mar 14 2023]
%D A079896 McMullen, Curtis. "Billiards and Teichmüller curves." Bulletin of the American Mathematical Society, 60:2  (2023), 195-250. See Table C.1.
%D A079896 A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, 5. Aufl., de Gruyter, Berlin, New York, 1973, p. 112.
%H A079896 Robin Visser, <a href="/A079896/b079896.txt">Table of n, a(n) for n = 1..10000</a> (terms n = 1..2001 from Vincenzo Librandi).
%H A079896 S. R. Finch, <a href="http://www.people.fas.harvard.edu/~sfinch/">Class number theory</a>
%H A079896 Steven R. Finch, <a href="/A000924/a000924.pdf">Class number theory</a> [Cached copy, with permission of the author]
%F A079896 a(2*k^2 + 2*k + 1) = 4*(k+1)^2 + 1 for k >= 0. - _Gheorghe Coserea_, Nov 07 2016
%F A079896 a(2*k^2 + 4*k + 2 + (k+1)*(-1)^k) = (2*k + 3)*(2*k + 3 + (-1)^k) for k >= 0. - _Bruno Berselli_, Nov 10 2016
%t A079896 Select[ Range[148], (Mod[ #, 4] == 0 || Mod[ #, 4] == 1) && !IntegerQ[ Sqrt[ # ]] & ]
%o A079896 (PARI) seq(N) = {
%o A079896   my(n = 1, v = vector(N), top = 0);
%o A079896   while (top < N,
%o A079896     if (n%4 < 2 && !issquare(n), v[top++] = n); n++;);
%o A079896   return(v);
%o A079896 };
%o A079896 seq(62) \\ _Gheorghe Coserea_, Nov 07 2016
%Y A079896 Cf. A014601, A042948 (with squares), A087048 (class numbers), A267857.
%K A079896 nonn,easy
%O A079896 1,1
%A A079896 _Wolfdieter Lang_, Jan 31 2003
%E A079896 More terms from _Robert G. Wilson v_, Mar 26 2003
%E A079896 Offset changed to 1 (since this is a list). - _N. J. A. Sloane_, Mar 14 2023