OFFSET
1,5
COMMENTS
LINKS
Zak Seidov, Table of n, a(n) for n = 1..1000.
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 *)
PROG
(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
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Oct 19 2006
EXTENSIONS
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jul 14 2007
STATUS
approved
