cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-13 of 13 results.

A307377 Array A(n, k) read by upwards antidiagonals giving the number of representative parallel primitive binary quadratic forms for discriminant Disc(n) = 4*D(n), with D(n) = A000037(n), and for representable integer |k| >= 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 2, 0, 0, 1, 0, 2, 0, 1, 1, 2, 1, 1, 0, 0, 2, 0, 0, 0, 1, 1, 2, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 2, 1, 2, 2, 2, 0, 0, 0, 2, 0
Offset: 1

Views

Author

Wolfdieter Lang, Apr 21 2019

Keywords

Comments

For the definition of representative parallel primitive forms (rpapfs) for discriminant Disc > 0 (the indefinite case) and representation of nonzero integers k see the Scholz-Schoeneberg reference, p. 105, or the Buell reference p. 49 (without use of the name parallel). For the procedure to find the primitive representative parallel forms (rpapfs) for Disc(n) = 4*D(n) = 4*A000037(n) and nonzero integer k see the W. Lang link given in A324251, section 3.
Note that the number of rpapfs of a discriminant Disc > 0 for k >= 1 is identical with the one for negative k. These forms differ in the signs of the a and c entries of these forms but not the b >= 0 entry (called an outer sign flip). See some examples below, and the program in the mentioned W. Lang link, section 3.
For the forms counted in the array A(n, k) see Table 3 of the W. Lang link given in A324251, for n = 1..30 and k = 1..10.
Compare the present array with the ones given in A324252 and A307303 for the number of rpapfs for discriminant 4*D(n) and representable positive and negative k, respectively, that are equivalent (under SL(2, Z)) to the reduced principal form F_p = [1, 2*s(n), -(D(n) - s(n)^2)] with s(n) = A000194(n), of the unreduced Pell form F(n) = [1, 0, -D(n)].
The rpapfs not counted in A324252 and A307303 are equivalent to forms of non-principal cycles for discriminant 4*D(n).
The total number of cycles (the class number h(n)) for discriminant 4*D(n) is given in A307359(n).
The array for the length of the periods of these cycles is given in A307378.
One half of the sum of the length of the periods is given in A307236.

Examples

			The array A(n, k) begins:
n,  D(n) \k  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ...
-------------------------------------------------------------
1,   2:      1 1 0 0 0 0 2 0 0  0  0  0  0  2  0
2,   3:      1 1 1 0 0 1 0 0 0  0  2  0  2  0  0
3,   5:      1 0 0 2 1 0 0 0 0  0  2  0  0  0  0
4,   6:      1 1 1 0 2 1 0 0 0  2  0  0  0  0  2
5,   7:      1 1 2 0 0 2 1 0 2  0  0  0  0  1  0
6,   8:      1 0 0 1 0 0 2 2 0  0  0  0  0  0  0
7,  10:      1 1 2 0 1 2 0 0 2  1  0  0  2  0  2
8,  11:      1 1 0 0 2 0 2 0 0  2  1  0  0  2  0
9,  12:      1 0 1 1 0 0 0 2 0  0  2  1  2  0  0
10, 13:      1 0 2 2 0 0 0 0 2  0  0  4  1  0  0
11, 14:      1 1 0 0 2 0 1 0 0  2  2  0  2  1  0
12, 15:      1 1 1 0 1 1 2 0 0  1  2  0  0  2  1
13, 17:      1 0 0 0 0 0 0 2 0  0  0  0  2  0  0
14, 18:      1 1 0 0 0 0 2 0 3  0  0  0  0  2  0
15, 19:      1 1 2 0 2 2 0 0 2  2  0  0  0  0  4
16, 20:      1 0 0 1 1 0 0 0 0  0  2  0  0  0  0
17, 21:      1 0 1 2 2 0 1 0 0  0  0  2  0  0  2
18, 22:      1 1 2 0 0 2 2 0 2  0  1  0  2  2  0
19, 23:      1 1 0 0 0 0 2 0 0  0  2  0  2  2  0
20, 24:      1 0 1 1 2 0 0 2 0  0  0  1  0  0  2
...
-------------------------------------------------------------
The antidiagonals:
       1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ...
1:     1
2:     1 1
3:     1 1 0
4:     1 0 1 0
5:     1 1 0 0 0
6:     1 1 1 2 0 0
7:     1 0 2 0 1 1 2
8:     1 1 0 0 2 0 0 0
9:     1 1 2 1 0 1 0 0 0
10:    1 0 0 0 0 2 0 0 0  0
11:    1 0 1 0 1 0 1 0 0  0  0
12:    1 1 2 1 2 2 2 0 0  0  2  0
13:    1 1 0 2 0 0 0 2 2  2  2  0  0
14:    1 0 1 0 0 0 2 0 0  0  0  0  2  2
15:    1 1 0 0 2 0 0 0 2  0  0  0  0  0  0
16:    1 1 0 0 1 0 0 2 0  1  0  0  0  0  0  0
17:    1 0 2 0 0 1 1 0 0  2  0  0  0  0  0  0  2
18:    1 0 0 0 0 0 2 0 2  0  1  0  0  1  2  0  0  0
19:    1 1 1 1 2 0 0 0 0  0  2  0  2  0  0  0  0  0  0
20:    1 1 2 2 1 2 2 2 0  2  0  1  0  0  0  0  0  0  0  0
...
For this triangle more of the columns of the array have been used than those that are shown.
-----------------------------------------------------------------------------
A(2, 3) = 1 because the representative parallel primitive form (rpapf) for discriminant 4*D(2) = 12 and k = +3 is [3, 0, -1], and the one for k= -3 is [-3, 0, 1] (sign flip in both, the a and c entries, but leaving the b entry).
A(3, 4) = 2 because the two rpapfs for discriminant 4*D(3) = 20 and k = +4 are [4, 2, -1] and [4, 6, 1], and the two ones for k = -4 are [-4, 2, 1], [-4, 6, -1].
		

References

  • D. A. Buell, Binary Quadratic Forms, Springer, 1989, chapter 3, pp. 21 - 43.
  • A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, 5. Aufl., de Gruyter, Berlin, New York, 1973, pp. 112 - 126.

Crossrefs

A307378 Irregular triangle T(n, k) read by rows: row n gives the periods of the cycles of binary quadratic forms of discriminant 4*D(n), with D(n) = A000037(n).

Original entry on oeis.org

2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 6, 2, 2, 2, 2, 10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 6, 6, 2, 2, 6, 6, 6, 6, 4, 4, 2, 2, 4, 4, 2, 6, 2, 2, 4, 4, 10, 2, 2, 4, 4, 8, 8, 4, 4, 4, 4, 4, 4, 6, 6, 2, 2, 2, 2, 2, 6, 6, 2, 2, 2, 2, 6, 6, 2, 2, 4, 4, 6, 2, 2, 2, 2, 10, 10, 8, 8, 6, 6, 12, 12, 4, 4, 2, 2, 2, 2, 2, 6, 2, 2, 6, 6, 6, 6
Offset: 1

Views

Author

Wolfdieter Lang, Apr 21 2019

Keywords

Comments

The length of row n is 2*A307236(n). This is the number of primitive reduced binary quadratic forms of discriminant 4*D(n), with D(n) = A000037(n).
The number of cycles in row n is A307359(n), the class number h(n) of binary quadratic forms of discriminant 4*D(n).
The principal cycle starts with F_p(n) = [1, 2*s(n), -(D(n) -s(n))^2], with s(n) = A000194(n). Its period is A307372(n). This is the only cycle (the class number is 1) for n = 1, 3, 10, 13, 24, ...
For class number h(n) >= 2 the cycles come mostly in pairs of cycles which can be transformed into each other by a sign flip operation on the outer entries of the forms of the cycle (called outer sign flip). Exceptions occur if cycles are identical with their outer sign flipped ones. This happens, e.g., for n = 7 with two cycles: one of length 2 (the principal cycle CR(2)) and one of length 6. This 6-cycle is also identical to the outer sign flipped one. See the example below.
See the Buell and Scholz-Schoeneberg references for cycles and class number, and also the W. Lang link given in A324251, with Table 2.

Examples

			The irregular triangle T(n, k) begins:
n,  D(n) \k   1  2  3  4 ...              2*A307236
---------------------------------------------------
1,   2:       2                              2
2,   3:       2  2                           4
3,   5:       2                              2
4,   6:       2  2                           4
5,   7:       4  4                           8
6,   8:       2  2                           4
7,  10:       2  6                           8
8,  11:       2  2                           4
9,  12:       2  2                           4
10, 13:      10                             10
11, 14:       4  4                           8
12, 15:       2  2  2  2                     8
13, 17:       2                              2
14, 18:       2  2                           4
15, 19:       6  6                          12
16, 20:       2  2                           4
17, 21:       6  6                          12
18, 22:       6  6                          12
19, 23:       4  4                           8
20, 24:       2  2  4  4                    12
...
---------------------------------------------------
n = 1, D(1) = 2: the only cycle is the principal 2-cycle [[1, 2, -1],[-1, 2, 1]] with discriminant 8.
n = 2, D(2) = 3: besides the principal 2-cycle [[1, 2, -2], [-2, 2, 1]] there is another 2-cycle with sign flips in the outer form entries [[2, 2, -1], [-1, 2, 2]], all with discriminant 12.
n = 7, D(7) = 10: the principal 2-cycle CR(7) is ([1, 6, -1], [-1, 6, 1]). The other 6-cyle is ([3, 4, -2], [-2, 4, 3], [3, 2, -3], [-3, 4, 2], [2, 4, -3], [-3, 2, 3]). Both cycles are invariant under outer entries sign flips.
		

References

  • D. A. Buell, Binary Quadratic Forms, Springer, 1989.
  • A. Scholz and B. Schoeneberg, Einführung in die Zahlentheorie, 5. Aufl., de Gruyter, Berlin, New York, 1973.

Crossrefs

Formula

T(n, k) = length of k-th cycle of reduced forms of discriminant 4*D(n), with D(n) = A000037(n).

A308687 a(n) = A305312(n)/4 if A305312(n)is even and a(n) = (A305312(n) - 1)/4 if A305312(n) is odd, for n >= 1.

Original entry on oeis.org

1, 8, 55, 379, 1891, 2600, 17821, 64261, 84680, 122149, 421849, 837224, 2183005, 3950155, 5738419, 18883369, 39331711, 74157931, 94070600, 128629621, 185381839, 269583560, 486268651, 1847753209, 2519186671, 3192137000, 4210906771, 6000283981, 8707689224, 12664688905, 20977322059, 41089519729, 85578188905, 86805069128, 195388310755, 409067053471
Offset: 1

Views

Author

Wolfdieter Lang, Jul 15 2019

Keywords

Comments

These numbers a(n), depending on the parity of the discriminants of Markoff forms Disc(n) = b(n)*(b(n) + 4) = A305312(n), with b(n) = A324250(n), enter the definition of representative parallel forms of Disc(n) and representation -m(n)^2, where m(n) = A002559(n) = (b(n) + 2)/3 are the Markoff numbers, in the following way. FPara(n) := [-m(n)^2, 2*j(n), -(j^2(n) - a(n))/m(n)^2] or [-m(n)^2, 2*j(n) + 1, -(j(n)^2 +j(n) - a(n))/m(n)^2], if Disc(n) is even or odd, respectively, with j(n) from the interval [0, m(n)^2 - 1] such that the third member of FPara(n) becomes an integer. See the W. Lang link in A324251, section 3 for representative parallel forms, and the Buell and Scholz-Schoeneberg references given there.
The trivial solution (x = 1, y = 0) of each of the #rpapfs (number of representative parallel and primitive forms) Fpara(n;k), for k = 1, 2, ..., #rpapfs, representing -m(n)^2 leads to a fundamental solution of any primitive form F = [a, b, c] = a*x^2 + b*x*y + c*y^2 of discriminant Disc := b^2 - 4*a*c and representing - m(n)^2, by a certain proper (determinant +1) equivalence transformation. For the Markoff triples the principal reduced form F_p = [1, b(n), -b(n)], representing -m(n)^2 is of interest. It is a member of a 2-cycle of reduced forms together with F = [-b(n), b(n), 1].

Crossrefs

Formula

a(n) = A305312(n)/4 or a(n) = (A305312(n) - 1)/4 if A305312(n) is even or odd, respectively, where A305312(n) = Disc(n) = b(n)*(b(n) + 4) with b(n) = 3*m(n) - 2 = A324250(n), and m(n) = A002559(n), for n >= 1.
Previous Showing 11-13 of 13 results.