|
|
A079896
|
|
Discriminants of indefinite binary quadratic forms.
|
|
41
|
|
|
5, 8, 12, 13, 17, 20, 21, 24, 28, 29, 32, 33, 37, 40, 41, 44, 45, 48, 52, 53, 56, 57, 60, 61, 65, 68, 69, 72, 73, 76, 77, 80, 84, 85, 88, 89, 92, 93, 96, 97, 101, 104, 105, 108, 109, 112, 113, 116, 117, 120, 124, 125, 128, 129, 132, 133, 136, 137, 140, 141, 145, 148
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Numbers n such that n == 0 (mod 4) or n == 1 (mod 4), but n is not a square.
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.
[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]
|
|
REFERENCES
|
McMullen, Curtis. "Billiards and Teichmüller curves." Bulletin of the American Mathematical Society, 60:2 (2023), 195-250. See Table C.1.
A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, 5. Aufl., de Gruyter, Berlin, New York, 1973, p. 112.
|
|
LINKS
|
|
|
FORMULA
|
a(2*k^2 + 4*k + 1 + (k+1)*(-1)^k) = (2*k + 3)*(2*k + 3 + (-1)^k) for k >= 0. - Bruno Berselli, Nov 10 2016
|
|
MATHEMATICA
|
Select[ Range[148], (Mod[ #, 4] == 0 || Mod[ #, 4] == 1) && !IntegerQ[ Sqrt[ # ]] & ]
|
|
PROG
|
(PARI) seq(N) = {
my(n = 1, v = vector(N), top = 0);
while (top < N,
if (n%4 < 2 && !issquare(n), v[top++] = n); n++; );
return(v);
};
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|