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.

Showing 1-10 of 13 results. Next

A084916 Positive numbers of the form k = x^2 - 3*y^2.

Original entry on oeis.org

1, 4, 6, 9, 13, 16, 22, 24, 25, 33, 36, 37, 46, 49, 52, 54, 61, 64, 69, 73, 78, 81, 88, 94, 96, 97, 100, 109, 117, 118, 121, 132, 141, 142, 144, 148, 150, 157, 166, 169, 177, 181, 184, 193, 196, 198, 208, 213, 214, 216, 222, 225, 229, 241, 244, 249, 253, 256
Offset: 1

Views

Author

Roger Cuculière, Jul 14 2003

Keywords

Comments

Equivalently, positive numbers of the form k = x^2 + 2xy - 2y^2. These are equivalent forms, of discriminant 12.
Also numbers representable as x^2 + 4*x*y + y^2 with 0 <= x <= y. - Gheorghe Coserea, Jul 29 2018 [The restriction 0 <= x <= y is not necessary. - Klaus Purath, Feb 05 2023]
From Klaus Purath, Feb 05 2023: (Start)
Also positive numbers of the form x^2 + 2*m*x*y + (m^2 - 3)*y^2. This includes all forms given above so far.
All terms are congruent to {0, 1, 4, 6, 9, 10} modulo 12.
The product of any two terms belongs to the sequence - (empirically secured up to a(k)*a(m) for 2 <= k, m <= 85). Thus it appears that this sequence is closed under multiplication. Perhaps someone can find a proof? (End)

Crossrefs

Cf. A031363, A035251, A243655 (primitive representations).
See A068228 for primes.

Programs

  • Mathematica
    Reap[For[n = 1, n < 300, n++, If[Reduce[n == x^2 - 3*y^2, {x, y}, Integers] =!= False, Sow[n]]]][[2, 1]] (* Jean-François Alcover, Dec 03 2013 *)

Extensions

More terms from Reinhard Zumkeller, Jul 17 2003

A324252 Triangle T(n, k) read by rows from upwards antidiagonals of array A, where A(n, k) is the number of families (also called classes) of proper solutions of the Pell equation x^2 - D(n)*y^2 = k, for k >= 1.

Original entry on oeis.org

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

Views

Author

Wolfdieter Lang, Apr 20 2019

Keywords

Comments

The array A(n, k) gives the number of the representative parallel binary quadratic primitive forms for discriminant Disc(n) = 4*D(n) = 4*A000037(n) and representation of positive integer k which are (properly) equivalent to the Pell form F(n) = [1, 0, -D(n)].
For the definition of representative parallel primitive forms for discriminant Disc > 0 (the indefinte 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.
Among them the parallel forms which are equivalent to the reduced principal form F_p(n) = [1, 2*s(n), -(D(n) - s(n))^2], with s(n) = A000194(n), are important to find all solutions (x, y) with gcd(x, y) = 1 (proper) of the Pell form F(n) = [1, 0, -D(n)] with Disc(F(n)) = 4*D(n) > 0 representing a positive integer k. The number of these parallel forms pa(n, k) gives the number of the proper fundamental solutions. The general solution is obtained from the fundamental solutions with the help of integer powers of the automorphic matrix corresponding to the cycle determined by the reduced principal form F_p(n).
Thus the array A(n,k) gives the number of proper families (also called classes) of solutions of the Pell equation x^2 - Dn(n)*y^2 = k, for positive integer k. The positions of the nonzero entries in row n give the list of the k values for which proper solutions exist.
These position lists are A057126 (conjecture) and A243655, for k = 1 and 2.
The first column has only 1s, showing that every Pell form [1, 0, -D(n)] represents k = +1, and that there is only one family of proper solutions.

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 0 0 0 0 1 0 0 0  0  0  0  2  0  0
3,   5:      1 0 0 2 1 0 0 0 0  0  2  0  0  0  0
4,   6:      1 0 1 0 0 0 0 0 0  2  0  0  0  0  0
5,   7:      1 1 0 0 0 0 0 0 2  0  0  0  0  0  0
6,   8:      1 0 0 0 0 0 0 1 0  0  0  0  0  0  0
7,  10:      1 0 0 0 0 2 0 0 2  1  0  0  0  0  2
8,  11:      1 0 0 0 2 0 0 0 0  0  0  0  0  2  0
9,  12:      1 0 0 1 0 0 0 0 0  0  0  0  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 0 0 0 0 0  0  2  0  0  0  0
12, 15:      1 0 0 0 0 0 0 0 0  1  0  0  0  0  0
13, 17:      1 0 0 0 0 0 0 2 0  0  0  0  2  0  0
14, 18:      1 0 0 0 0 0 2 0 1  0  0  0  0  0  0
15, 19:      1 0 0 0 2 2 0 0 2  0  0  0  0  0  0
16, 20:      1 0 0 0 1 0 0 0 0  0  0  0  0  0  0
17, 21:      1 0 0 2 0 0 1 0 0  0  0  0  0  0  2
18, 22:      1 0 2 0 0 0 0 0 2  0  1  0  0  2  0
19, 23:      1 1 0 0 0 0 0 0 0  0  0  0  2  0  0
20, 24:      1 0 0 0 0 0 0 0 0  0  0  1  0  0  0
...
-------------------------------------------------------------
The triangle T(n, k) begins:
n\k    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 0 0
4:     1 0 0 0
5:     1 0 0 0 0
6:     1 1 1 2 0 0
7:     1 0 0 0 1 1 2
8:     1 0 0 0 0 0 0 0
9:     1 0 0 0 0 0 0 0 0
10:    1 0 0 0 0 0 0 0 0  0
11:    1 0 0 0 0 0 0 0 0  0  0
12:    1 1 2 1 2 2 0 0 0  0  0  0
13:    1 0 0 2 0 0 0 1 2  2  2  0  0
14:    1 0 0 0 0 0 0 0 0  0  0  0  2  2
15:    1 0 0 0 0 0 0 0 2  0  0  0  0  0  0
16:    1 0 0 0 0 0 0 0 0  1  0  0  0  0  0  0
17:    1 0 0 0 0 0 0 0 0  0  0  0  0  0  0  0  2
18:    1 0 0 0 0 0 0 0 2  0  0  0  0  0  0  0  0  0
19:    1 0 0 0 2 0 0 0 0  0  0  0  0  0  0  0  0  0  0
20:    1 1 2 2 1 2 2 2 0  0  0  0  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(5, 9) = 2 = T(13, 9) because D(5) = 7, and the Pell form F(5) with disc(F(5)) = 4*7 = 28 representing k = +9 has 2 families (classes) of proper solutions generated from the two positive fundamental positive solutions (x10, y10) = (11, 4) and (x20, y20) = (4, 1). They are obtained from the trivial solutions of the parallel forms [9, 8, 1] and [9, 10, 2], respectively. See the W. Lang link in A324251, section 3.
		

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

Formula

T(n, k) = A(n-k+1, k) for 1 <= k <= n, with A(n,k) the number of proper (positive) fundamental solutions of the Pell equation x^2 - D(n)*y^2 = k >= 1, with D(n) = A000037(n), for n >= 1.

A243702 Nonnegative numbers represented by the indefinite quadratic form x^2 + 13xy - 9y^2.

Original entry on oeis.org

0, 1, 4, 5, 9, 16, 20, 21, 25, 36, 39, 45, 49, 51, 59, 64, 80, 81, 84, 91, 100, 105, 119, 121, 125, 131, 139, 141, 144, 156, 159, 169, 180, 189, 195, 196, 201, 204, 221, 225, 236, 241, 245, 255, 256, 269, 271, 279, 289, 291, 295, 320, 324, 329, 336, 351, 359
Offset: 1

Views

Author

N. J. A. Sloane, Jun 17 2014

Keywords

Comments

Discriminant 205.

Crossrefs

Cf. A243701 (primes), A243702 (this sequence), A372518 (primitively).

Programs

  • SageMath
    load('https://raw.githubusercontent.com/PeterLuschny/BinaryQuadraticForms/main/BinaryQF.sage')
    Q = binaryQF([1, 13, -9])
    print(Q.represented_positives(360, 'all'))  # '0' is missing as indicated by the function name. #  Peter Luschny, May 04 2024

A243654 Nonnegative numbers represented by the indefinite quadratic form 3x^2+5xy-3y^2, of discriminant 61.

Original entry on oeis.org

0, 1, 3, 4, 5, 9, 12, 13, 15, 16, 19, 20, 25, 27, 36, 39, 41, 45, 47, 48, 49, 52, 57, 60, 61, 64, 65, 73, 75, 76, 80, 81, 83, 95, 97, 100, 103, 107, 108, 109, 113, 117, 121, 123, 125, 127, 131, 135, 137, 141, 144, 147, 149, 156, 163, 164, 167, 169, 171, 179, 180, 183, 188, 192, 195, 196, 197, 199
Offset: 1

Views

Author

N. J. A. Sloane, Jun 10 2014

Keywords

Comments

Also, nonnegative numbers represented by the indefinite quadratic form x^2-61y^2, of discriminant 244. The corresponding reduced form is x^2+14xy-12y^2.
Also 12*a(n) has the form z^2 - 61*y^2, where z = 6*x+5*y. [Bruno Berselli, Jun 20 2014]

Crossrefs

For primes see A141215.

Programs

  • Maple
    select(t -> nops([isolve(x^2-61*y^2=t)])>0,[$0..200]); # Robert Israel, Jun 11 2014

A377607 Positive integers D such that the generalized Pell equation X^2 - D Y^2 = 3 is solvable over the integers.

Original entry on oeis.org

1, 6, 13, 22, 33, 46, 61, 69, 73, 78, 94, 97, 109, 118, 141, 157, 166, 177, 181, 193, 213, 214, 222, 241, 249, 253, 262, 277, 286, 313, 321, 334, 337, 358, 366, 382, 393, 397, 409, 421, 429, 433, 438, 454, 457, 478, 481, 501, 502, 517, 526, 537, 541, 573, 598, 601, 613, 622, 649, 654, 661
Offset: 1

Views

Author

Robin Visser, Nov 02 2024

Keywords

Comments

Calculated using Dario Alpern's quadratic Diophantine solver, see link.

Examples

			The first fundamental solutions [x(n), y(n)] are (the first entry gives D(n)=a(n)):
[1, [2, 1]], [6, [3, 1]], [13, [4, 1]], [22, [5, 1]], [33, [6, 1]], [46, [7, 1]], [61, [8, 1]], [69, [108, 13]], [73, [94, 11]], [78, [9, 1]], [94, [223, 23]], [97, [10, 1]], [109, [9532, 913]], [118, [11, 1]], [141, [12, 1]], [157, [289580, 23111]], [166, [13, 1]], [177, [306, 23]], [181, [148, 11]], [193, [14, 1]], ...
		

Crossrefs

Programs

  • Python
    from itertools import count, islice
    from sympy.solvers.diophantine.diophantine import diop_DN
    def A377607_gen(startvalue=1): # generator of terms >= startvalue
        return filter(lambda d:len(diop_DN(d,3)), count(max(startvalue,1)))
    A377607_list = list(islice(A377607_gen(),61)) # Chai Wah Wu, Nov 03 2024

A243656 Positive integers primitively represented by x^2+3xy-y^2.

Original entry on oeis.org

1, 3, 9, 13, 17, 23, 27, 29, 39, 43, 51, 53, 61, 69, 79, 81, 87, 101, 103, 107, 113, 117, 127, 129, 131, 139, 153, 157, 159, 173, 179, 181, 183, 191, 199, 207, 211, 221, 233, 237, 243, 251, 257, 261, 263, 269, 277, 283, 289, 299, 303, 309
Offset: 1

Views

Author

N. J. A. Sloane, Jun 11 2014

Keywords

Crossrefs

A243703 Nonnegative numbers represented by the indefinite quadratic form -x^2+13xy+9y^2.

Original entry on oeis.org

0, 9, 21, 31, 36, 39, 41, 45, 49, 51, 61, 81, 84, 91, 105, 119, 124, 141, 144, 155, 156, 159, 164, 169, 180, 189, 195, 196, 201, 204, 205, 221, 225, 244, 245, 251, 255, 279, 289, 291, 305, 324, 329, 336, 349, 351, 364, 369, 371, 379, 389, 401, 405, 411, 419
Offset: 1

Views

Author

N. J. A. Sloane, Jun 17 2014

Keywords

Comments

Discriminant 205.

Crossrefs

Primes: A243704.

A243705 Nonnegative numbers represented by the indefinite quadratic form 3x^2+13xy-3y^2.

Original entry on oeis.org

0, 3, 7, 12, 13, 15, 17, 27, 28, 35, 47, 48, 52, 53, 60, 63, 65, 67, 68, 75, 85, 93, 97, 108, 112, 117, 123, 135, 137, 140, 147, 153, 157, 167, 175, 177, 183, 188, 192, 193, 208, 212, 217, 227, 233, 235, 240, 243, 252, 257, 260, 263, 265, 268
Offset: 1

Views

Author

N. J. A. Sloane, Jun 17 2014

Keywords

Comments

Discriminant 205.
12*a(n) has the form z^2 - 205*y^2, where z = 6*x+13*y. In fact, this is a particular case of the following identity on the numbers of the form a*x^2+b*x*y+c*y^2: 4*a*(a*x^2+b*x*y+c*y^2) = (2*a*x+b*y)^2-(b^2 -4*a*c)*y^2. [Bruno Berselli, Jun 20 2014]

Crossrefs

Primes: A243706.

A309136 Nonnegative integers of the form x^2+15*x*y-y^2.

Original entry on oeis.org

0, 1, 4, 9, 15, 16, 25, 27, 33, 36, 37, 45, 49, 51, 53, 55, 57, 60, 64, 75, 81, 85, 95, 99, 100, 108, 121, 125, 129, 132, 135, 144, 148, 153, 165, 169, 171, 173, 180, 183, 187, 193, 196, 204, 209, 212, 213, 215, 220, 225, 228, 229, 240, 241, 243, 249, 255, 256
Offset: 1

Views

Author

Hugo Pfoertner, Jul 14 2019

Keywords

Comments

Discriminant of indefinite binary quadratic form: 229.

Crossrefs

Primes in this sequence: A141166.

Programs

  • Mathematica
    Reap[For[n=0,n<=58,n++,If[Reduce[x^2+15*x*y-y^2==n,{x,y},Integers]=!=False,Sow[n]]]][[2,1]] (* Vincenzo Librandi, Nov 16 2024 *)
    sol[t_]:=Solve[x^2+15*x*y-y^2==t,{x,y},Integers]; Select[Range[0,256],sol[#]!={}&] (* Vincenzo Librandi, Nov 25 2024 *)

A309133 Nonnegative integers of the form 4*x^2+6*x*y-7*y^2.

Original entry on oeis.org

0, 3, 4, 7, 9, 11, 12, 16, 21, 27, 28, 33, 36, 41, 44, 47, 48, 49, 53, 63, 64, 71, 73, 75, 77, 81, 83, 84, 99, 100, 101, 108, 111, 112, 121, 123, 127, 132, 141, 144, 147, 148, 149, 157, 159, 164, 173, 175, 176, 181, 188, 189, 192, 196, 197, 201, 211, 212, 213
Offset: 1

Views

Author

Hugo Pfoertner, Jul 14 2019

Keywords

Comments

Discriminant of indefinite binary quadratic form: 148.

Crossrefs

Primes in this sequence: A141161.
Showing 1-10 of 13 results. Next