cp's OEIS Frontend

Positive integers k such that x^2 - 4xy + y^2 + k = 0 has integer solutions. (See the CROSSREFS section for sequences relating to solutions for particular k.)

Comments on method used, from Colin Barker, Jun 06 2014: (Start)

In general, we want to find the values of f, from 1 to 400 say, for which x^2 + bxy + y^2 + f = 0 has integer solutions for a given b.

In order to solve x^2 + bxy + y^2 + f = 0 we can solve the Pellian equation x^2 - Dy^2 = N, where D = b*b - 4 and N = 4*(b*b - 4)*f.

But since sqrt(D) < N, the classical method of solving x^2 - Dy^2 = N does not work. So I implemented the method described in the 1998 sci.math reference, which says:

"There are several methods for solving the Pellian equation when |N| > sqrt(d). One is to use a brute-force search. If N < 0 then search on y = sqrt(abs(n/d)) to sqrt((abs(n)(x1 + 1))/(2d)) and if N > 0 search on y = 0 to sqrt((n(x1 - 1))/(2d)) where (x1, y1) is the minimum positive solution (x, y) to x^2 - dy^2 = 1. If N < 0, for each positive (x, y) found by the search, also take (-x, y). If N > 0, also take (x, -y). In either case, all positive solutions are generated from these using (x1, y1) in the standard way."

Incidentally all my Pell code is written in B-Prolog, and is somewhat voluminous. (End)

Also, positive integers of the form -x^2 + 2xy + 2y^2 of discriminant 12. - N. J. A. Sloane, May 31 2014 [Corrected by Klaus Purath, May 07 2023]

The equivalent sequence for x^2 - 3xy + y^2 + k = 0 is A031363.

The equivalent sequence for x^2 - 5xy + y^2 + k = 0 is A237351.

A positive k does not appear in this sequence if and only if there is no integer solution of x^2 - 3*y^2 = -k with (i) 0 < y^2 <= k/2 and (ii) 0 <= x^2 <= k/2. See the Nagell reference Theorems 108 a and 109, pp. 206-7, with D = 3, N = k and (x_1,y_1) = (2,1). - Wolfdieter Lang, Jan 09 2015

From Klaus Purath, May 07 2023: (Start)

There are no squares in this sequence. Products of an odd number of terms as well as products of an odd number of terms and any terms of A014209 belong to the sequence.

Products of an even number of terms are terms of A014209. The union of this sequence and A014209 is closed under multiplication.

A positive number belongs to this sequence if and only if it contains an odd number of prime factors congruent to {2, 3, 11} modulo 12. If it contains prime factors congruent to {5, 7} modulo 12, these occur only with even exponents. (End)

From Klaus Purath, Jul 09 2023: (Start)

Any term of the sequence raised to an odd power also belongs to the sequence. Proof: t^(2n+1) = t*t^2n = (3*x^2 - y^2)*t^2n = 3*(x*t^n)^2 - (y*t^n)^2. It seems that t^(2n+1) occurs only if t also is in the sequence.

Joerg Arndt has proved that there are no squares in this sequence: Assume s^2 = 3*y^2 - x^2, then s^2 + x^2 = 3 * y^2, but the sum of two squares cannot be 3 * y^2, qed. (End)

That products of any 3 terms belong to the sequence can be proved by the following identity: (na^2 - b^2) (nc^2 - d^2) (ne^2 - f^2) = n[a(nce + df) + b(cf + de)]^2 - [na(cf + de) + b(nce + df)]^2. This can be verified by expanding both sides of the equation. - Klaus Purath, Jul 14 2023

From Klaus Purath, Feb 17 2024: (Start)

Positive numbers of the form 15x^2 - y^2. The reduced form is -x^2 + 6xy + 6y^2.

Even powers of terms as well as products of an even number of terms belong to A243188. This can be proved with respect to the forms [a,0,-c] and [a, 0, +c] by the following identities: (au^2 - cv^2)(ax^2 - cy^2) = (aux + cvy)^2 - ac(uy + vx)^2 and (au^2 + cv^2)(ax^2 + cy^2) = (aux - cvy)^2 + ac(uy + vx)^2 for all a, c, u, v, x, y in R. This can be verified by expanding both sides of the equations. Generalization (conjecture): This multiplication rule applies to all sequences represented by any binary quadratic form [a, b, c].

Odd powers of terms as well as products of an odd number of terms belong to the sequence. This can be proved with respect to the forms [a,0,-c] and [a, 0, +c] by the following identities: (as^2 - ct^2)(au^2 - cv^2)(ax^2 - cy^2) = a[s(aux + cvy) + ct(uy + vx)]^2 - c[as(uy + vx) + t(aux + cvy)]^2 and (as^2 + ct^2)(au^2 + cv^2)(ax^2 + cy^2) = a[s(aux - cvy) - ct(uy + vx)]^2 + c[as(uy + vx) + t(aux - cvy)]^2 for all a, c, s, t, u, v, x, y in R. This can be verified by expanding both sides of the equations. Generalization (conjecture): This multiplication rule applies to all sequences represented by any binary quadratic form [a, b, c].

If we denote any term of this sequence by B and correspondingly of A243189 by C and of A243190 by D, then B*C = D, C*D = B and B*D = C. This can be proved by the following identities, where the sequence (B) is represented by [kn, 0, -1], (C) by [n, 0, -k] and (D) by [k, 0, -n].

Proof of B*C = D: (knu^2 - v^2)(nx^2 - ky^2) = k(nux + vy)^2 - n(kuy + vx)^2 for k, n, u, v, x, y in R.

Proof of C*D = B: (nu^2 - kv^2)(kx^2 - ny^2) = kn(ux + vy)^2 - (nuy + kvx)^2 for k, n, u, v, x, y in R.

Proof of B*D = C: (knu^2 - v^2)(kx^2 - ny^2) = n(kux + vy)^2 - k(nuy + vx)^2 for k, n, u, v, x, y in R. This can be verified by expanding both sides of the equations.

Generalization (conjecture): If there are three sequences of a given positive discriminant that are represented by the forms [a1, b1, c1], [a2, b2, c2] and [a1*a2, b3, c3] for a1, a2 != 1, then the BCD rules apply to these sequences. (End)

Nonnegative numbers of the form 8x^2 - y^2. - Jon E. Schoenfield, Jun 03 2022

Discriminant = 21. Class number = 2. Binary quadratic forms a*x^2 + b*x*y + c*y^2 have discriminant d = b^2 - 4ac and gcd(a,b,c) = 1 (primitive).

Except a(1) = 3, primes congruent to {5, 17, 20} mod 21. - Vincenzo Librandi, Jul 11 2018

The comment above is true since the binary quadratic forms with discriminant 21 are in two classes as well as two genera, so there is one class in each genus. A141159 is in the other genus, with primes = 7 or congruent to {1, 4, 16} mod 21. - Jianing Song, Jul 12 2018

4*a(n) can be written in the form 21*w^2 - z^2. - Bruno Berselli, Jul 13 2018

Both forms [-1, 3, 3] (reduced) and [5, 9, 3] (not reduced) are properly (via a determinant +1 matrix) equivalent to the reduced form [3, 3, -1], a member of the 2-cycle [[3, 3, -1], [-1, 3, 3]]. The other reduced form is the principal form [1, 3, -3], with 2-cycle [[1, 3, -3], [-3, 3, 1]] (see, e.g., A141159, A139492). - Wolfdieter Lang, Jun 24 2019

Positive integers n such that x^2 - 99 y^2 + n = 0 has integer solutions. - Robert Israel, Oct 22 2024