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.

A099998 Bisection of A001597.

Original entry on oeis.org

4, 9, 25, 32, 49, 81, 121, 128, 169, 216, 243, 289, 343, 400, 484, 529, 625, 729, 841, 961, 1024, 1156, 1296, 1369, 1521, 1681, 1764, 1936, 2048, 2187, 2209, 2401, 2601, 2744, 2916, 3125, 3249, 3375, 3600, 3844, 4096, 4356, 4624, 4900, 5041, 5329, 5625, 5832
Offset: 1

Views

Author

N. J. A. Sloane, Nov 20 2004

Keywords

Programs

  • Mathematica
    t = Union@ Flatten@ Table[ n^i, {n, 2, Sqrt[6083]}, {i, 2, Log[n, 6083]}]; t[[2# - 1]] & /@ Range@(Length@t/2)
  • Python
    from sympy import mobius, integer_nthroot
    def A099998(n):
        def f(x): return int((n<<1)-2+x+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
        kmin, kmax = 1,2
        while f(kmax) >= kmax:
            kmax <<= 1
        while True:
            kmid = kmax+kmin>>1
            if f(kmid) < kmid:
                kmax = kmid
            else:
                kmin = kmid
            if kmax-kmin <= 1:
                break
        return kmax # Chai Wah Wu, Aug 14 2024

Extensions

More terms from Robert G. Wilson v, Dec 14 2005