cp's OEIS Frontend

Distance d is equal to 0 when x = k^2 and y = k^5.

For x values see A179407.

For y values see A179408.

Conjecture (from Artur Jasinski): For any positive number x >= A179407(n), the distance d between the fifth power of x and the square of any y (such that x != k^2 and y != k^5) can't be less than A179406(n).

The formula for the PDGF3(z;n) polynomials in the GF3 denominators of A156927 can be found below.

The general structure of the GFKT3(z;p) that generate the z^p coefficients of the PDGF3(z; n) polynomials can also be found below. The KT3(z;p) polynomials in the numerators of the GFKT3(z; p) have a nice symmetrical structure.

The sequence of the number of terms of the first few KT3(z;p) polynomials is 1, 2, 4, 7, 10, 13, 14, 17, 20, 23, 26, 29, 32, 34, 36, 39, 42. The differences of this sequence and that of the number of terms of the KT4(z;p), see A157705, follow a simple pattern.

A Maple algorithm that generates relevant GFKT3(z;p) information can be found below.

The formula for the PDGF4(z;n) polynomials in the GF4 denominators of A156933 can be found below.

The general structure of the GFKT4(z;p) that generate the z^p coefficients of the PDGF4(z;n) polynomials can also be found below. The KT4(z;p) polynomials in the numerators of the GFKT4(z;p) have a nice symmetrical structure.

The sequence of the number of terms of the first few KT4(z;p) polynomials is 1, 3, 5, 7, 10, 13, 15, 18, 20, 23, 26, 29, 32, 34, 37, 40, 42. The differences of this sequence and that of the number of terms of the KT3(z;p), see A157704, follow a simple pattern.

A Maple algorithm that generates relevant GFKT4(z;p) information can be found below.

The k-th row (k>=1) contains T(i,k) for i=1 to k+1, where k=[2*n+1+(-1)^(n-1)]/4 and T(i,k) satisfies !n = Sum_{i=1..k+1} T(i,k) * n^(k-i+1) / k!.

Note that 60 is half of 120, the number of elements in Charles Janet's 32-column table. This implies the existence of element 119, Ununennium (structure last number is 9) and element 120, Unbinilium (10). Structure of element 117, Ununseptium, is unknown.

The formula for the PDGF1(z;n) polynomials in the GF1 denominators of A156921 can be found below.

The general structure of the GFKT1(z;p) that generate the z^p coefficients of the PDGF1(z; n) polynomials can also be found below. The KT1(z;p) polynomials in the numerators of the GFKT1(z;p) have a nice symmetrical structure.

The sequence of the number of terms of the first few KT1(z;p) polynomials is: 1, 2, 3, 6, 7, 10, 13, 14, 17, 20, 23, 24, 27, 30, 33, 36, 37, 40. The first differences follow a simple pattern. The positions of the 1's follow the Lazy Caterer's sequence A000124.

A Maple algorithm that generates relevant GFKT1(z;p) information can be found below.

The formula for the PDGF2(z;n) polynomials in the GF2 denominators of A156925 can be found below.

The general structure of the GFKT2(z;p) that generate the z^p coefficients of the PDGF2(z; n) polynomials can also be found below. The KT2(z;p) polynomials in the numerators of the GFKT2(z;p) have a nice symmetrical structure.

The sequence of the number of terms of the first few KT2(z;p) polynomials is: 1, 1, 2, 5, 6, 9, 12, 13, 16, 19, 22, 23, 26. The first differences follow a simple pattern. The positions of the 1's follow the Lazy Caterer's sequence A000124 with one exception, here a(0) = 0.

A Maple algorithm that generates relevant GFKT2(z;p) information can be found below.

The rather strange ZL(n) sequence rules both the Zeta and Lambda triangles.

The Zeta triangle led to the first and the Lambda triangle to the second Maple algorithm.

The first ZL(n) formula is a conjecture. This formula links the ZL(n) to the prime numbers A000040; see A217983, A128060, A130290 and the third Maple program.

A quadratic form is primitive if the GCD of the coefficients is 1. For example, the quadratic form 2*x^2+4*y^2 is not primitive.

Two quadratic forms f(x,y) = a*x^2+b*x*y+c*y^2 and g(x,y) = p*x^2+q*x*y+r*y^2 are distinct (or inequivalent) if and only if one cannot be obtained by a linear transformation (of the variables x, y) from the other. For example, the three quadratic forms u(x,y) = 3*x^2+2*x*y+3*y^2, v(x,y) = 3*x^2+4*x*y+4*y^2 and w(x,y) = 3*x^2+10*x*y+11*y^2 are equivalent because v(x,y) = u(x+y,-y) and w(x,y) = v(x+y,y). Also, w(x,y) = u(x+2*y,-y). Similarly, the two quadratic forms s(x,y) = 8*x^2+9*y^2 and t(x,y) = 17*x^2+50*x*y+41*y^2 are equivalent because t(x,y) = s(x+2*y,x+y).

The quadratic form x^2+n*y^2 is one such form and the only such form if n is a convenient number (A000926).

a(n) = 1 if and only if n is a convenient number (A000926).

Any prime p such that p is a quadratic residue (mod 4n) or p-n is a quadratic residue (mod 4n) can be represented by exactly one of the a(n) distinct primitive quadratic forms of discriminant = -4n in at most four different ways (if n >= 2) or in at most eight different ways (if n = 1).

If a prime p can be written in the form x^2+n*y^2, then either p is a quadratic residue (mod 4n) or p-n is a quadratic residue (mod 4n), assuming that p^2 does not divide n.

For primes p such that p is a quadratic residue (mod 4n) or p-n is a quadratic residue (mod 4n), there is a lowest square m^2 such that m^2*p can be written in form x^2+n*y^2, where x and y are nonnegative integers (see A232529 and A232530).

If n is a prime congruent to 3 (mod 4), then a(n) = A232551(n).

The product of two numbers (prime or composite, same or different) which can be represented by the same quadratic form of discriminant = -4n can be written in the form x^2+n*y^2, as the following identity shows.

(X*a^2+Y*a*b+Z*b^2)*(X*c^2+Y*c*d+Z*d^2) = (a*c*X+b*d*Z+a*d*(Y/2)+b*c*(Y/2))^2 + ((X*Z)-(Y^2/4))*(a*d-b*c)^2.

(X*a^2+Y*a*b+Z*b^2)*(X*c^2+Y*c*d+Z*d^2) = (a*c*X+b*d*((Y^2/(2*X))-Z)+a*d*(Y/2)+b*c*(Y/2))^2 + ((X*Z)-(Y^2/4))*(b*d*(Y/X)+a*d+b*c)^2.

Note that for the latter equation, (a*c*X+b*d*((Y^2/(2*X))-Z)+a*d*(Y/2)+b*c*(Y/2)) and (b*d*(Y/X)+a*d+b*c) need not always be integers. If they are both integers, then it will be a second representation of the product of (X*a^2+Y*a*b+Z*b^2) and (X*c^2+Y*c*d+Z*d^2) in the form x^2+((X*Z)-(Y^2/4))*y^2.