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-5 of 5 results.

A087285 Possible differences between a cube and the next smaller square.

Original entry on oeis.org

2, 4, 7, 11, 13, 15, 19, 20, 26, 28, 35, 39, 40, 45, 47, 48, 49, 53, 55, 56, 60, 63, 67, 74, 76, 79, 81, 83, 100, 104, 107, 109, 116, 127, 135, 139, 146, 147, 148, 150, 152, 155, 170, 174, 180, 184, 186, 191, 193, 200, 207, 212, 215, 216, 233, 235, 242, 244, 249
Offset: 1

Views

Author

Hugo Pfoertner, Sep 18 2003

Keywords

Comments

Sequence and program were provided by Ralf Stephan Aug 28 2003.
Comment from David W. Wilson, Jan 05 2009: I believe there is an algorithm for solving x^3 - y^2 = k, which should have a finite number of solutions for any k. That means that we should in principle be able to compute this sequence.
Up to the initial 0 in A165288, these two sequences appear to be the same, but according to its current definition, A165288 should be the same as the (different) sequence A229618 = the range of the sequence A181138 (= least k>0 such that n^2+k is a cube): If n^2+k=y^3 is the smallest cube above n^2, then n^2 is not necessarily the largest square below y^3. E.g., 18 is in A181138 and A229618, since 9+18=27 is the least cube above 9=3^2, but 25=5^2 is the largest square below 27. - M. F. Hasler, Oct 05 2013

Examples

			a(1)=2 because the next smaller square below 3^3=27 is 5^2=25.
		

References

Crossrefs

Programs

  • PARI
    v=vector(200):for(n=2,10^7,t=n^3:s=sqrtint(t)^2: if(s==t,s=sqrtint(t-1)^2):tt=t-s: if(tt>0&&tt<=200&&!v[tt],v[tt]=n)):for(k=1,200,if(v[k],print1(k",")))

A087286 Possible differences between a square and the closest smaller cube.

Original entry on oeis.org

1, 3, 8, 9, 12, 15, 17, 18, 19, 22, 24, 30, 36, 37, 38, 40, 44, 55, 57, 64, 65, 68, 71, 73, 79, 80, 89, 97, 98, 100, 101, 106, 107, 108, 112, 113, 119, 121, 128, 129, 138, 141, 145, 148, 151, 154, 156, 161, 163, 164, 168, 169, 171, 172, 190, 196, 197, 198, 204, 208
Offset: 1

Views

Author

Hugo Pfoertner, Sep 18 2003

Keywords

Comments

Integers of the form m^2 - floor((m^2-1)^(1/3))^3 for integer m.

Examples

			2^2-1^3=3, 3^2-2^3=1, 4^2-2^3=8, 5^2-2^3=17, 6^2-3^3=9, 7^2-3^3=22,...,
1138^2-109^3=15
		

Crossrefs

A229618 Numbers that are the distance between a square and the next larger cube.

Original entry on oeis.org

1, 2, 4, 7, 11, 13, 15, 18, 19, 20, 25, 26, 28, 35, 39, 40, 44, 45, 47, 48, 49, 53, 54, 55, 56, 60, 61, 63, 67, 71, 72, 74, 76, 79, 81, 83, 87, 100, 104, 106, 107, 109, 112, 116, 118, 126, 127, 128, 135, 139, 143
Offset: 1

Views

Author

M. F. Hasler, Sep 26 2013

Keywords

Comments

This is the range of the sequence A181138 (= least k>0 such that n^2+k is a cube). Note that this is not the same as A087285 = range of A077116 = difference between a cube and the next smaller square: If n^2+k = y^3 is the smallest cube above n^2, then n^2 is not necessarily the largest square below y^3, e.g., 9+18 = 27 = 3^3 is the least cube above 9 = 3^2, but 25 = 5^2 is the largest square below 27. Therefore the number 18 is in this sequence, but not in A087285.
See A077116 and A181138 and A179386 for motivations.
Apart from the leading 1, this is a subsequence of A106265, which does not require the square to be the next smaller one: For example, 23 = 27 - 4 = 3^3 - 2^2 is in A106265 but not in this sequence. A165288 is a subsequence of this one, except for the initial term.

Examples

			a(1) = 1 = 1^3-0^2 (but this is the only solution to y^3-x^2 = 1).
a(2) = 2 = 27-25 (= 3^3-5^2), and this is the only solution to y^3-x^2 = 2.
The number 3 is not in the sequence since there are no x, y > 0 such that y^3-x^2 = 3.
a(3) = 4 = 8-4 (= 2^3-2^2) = 125-121 (= 5^3-11^2); these are the only two solutions to y^3-x^2 = 4, for all x>11, the minimal positive y^3-x^2 is 7.
		

Crossrefs

A228948 Numbers n such that n^3 + k^2 = m^3 for some k>0, m>0.

Original entry on oeis.org

6, 7, 11, 23, 24, 26, 28, 31, 38, 42, 44, 47, 54, 55, 61, 63, 84, 91, 92, 95, 96, 99, 104, 110, 111, 112, 118, 119, 124, 138
Offset: 1

Views

Author

M. F. Hasler, Oct 05 2013

Keywords

Comments

Cube root of perfect cubes in A087285 or in A229618 are in the present sequence, but this does not yield all terms, because these sequences require k^2 to be the largest square < m^3.
Numbers k such that Mordell's equation y^2 = x^3 - k^3 has more than 1 integral solution. (Note that it is necessary that x is positive.) In other words, numbers k such that Mordell's equation y^2 = x^3 - k^3 has solutions other than the trivial solution (k,0). - Jianing Song, Sep 24 2022

Examples

			6 is a term since the equation y^2 = x^3 - 6^3 has 5 solutions (6,0), (10,+-28), and (33,+-189). - _Jianing Song_, Sep 24 2022
		

Crossrefs

Cube root of A179419.
Cf. A356709, A356720. Complement of A356713.

Extensions

More terms added by Jianing Song, Sep 24 2022 based on A179419.

A125643 Squares and cubes (with repetition).

Original entry on oeis.org

0, 0, 1, 1, 4, 8, 9, 16, 25, 27, 36, 49, 64, 64, 81, 100, 121, 125, 144, 169, 196, 216, 225, 256, 289, 324, 343, 361, 400, 441, 484, 512, 529, 576, 625, 676, 729, 729, 784, 841, 900, 961, 1000, 1024, 1089, 1156, 1225, 1296, 1331, 1369, 1444, 1521, 1600, 1681
Offset: 1

Views

Author

Zak Seidov, Oct 19 2006

Keywords

Comments

Repeating terms are sixth powers: 0,1,64,729,... (A001014).
For numbers not appearing as a difference between a square and an adjacent cube in this list, see A054504 and A081121.

Crossrefs

Cf. A002760 (squares and cubes (without repetitions)).

Programs

  • Mathematica
    m=1681;cm=Floor[m^(1/3)];sm=Floor[Sqrt[m]];s=Range[0,sm]^2;c=Range[0,cm]^3;Sort[Join[s,c]] (* James C. McMahon, Dec 20 2024 *)
  • Python
    from math import isqrt
    from sympy import integer_nthroot
    def A125643(n):
        if n <= 4: return n-1>>1
        def bisection(f,kmin=0,kmax=1):
            while f(kmax) > kmax: kmax <<= 1
            while kmax-kmin > 1:
                kmid = kmax+kmin>>1
                if f(kmid) <= kmid:
                    kmax = kmid
                else:
                    kmin = kmid
            return kmax
        def f(x): return n-2+x-integer_nthroot(x,3)[0]-isqrt(x)
        return bisection(f,n-2,n-2) # Chai Wah Wu, Oct 14 2024

Extensions

Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jul 14 2007
Showing 1-5 of 5 results.