OFFSET
1,3
COMMENTS
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..10000 (n = 1..1000 from T. D. Noe).
MATHEMATICA
Join[{0}, Table[k = 1; While[! IntegerQ[Sqrt[n^3 + k^2]], k++]; k, {n, 2, 100}]] (* T. D. Noe, Nov 21 2013 *)
PROG
(Python)
import math
for n in range(77):
n3 = n*n*n
y=1
for k in range(1, 10000001):
s = n3 + k*k
r = int(math.sqrt(s))
if r*r == s:
print(k, end=', ')
y=0
break
if y: print(end='-, ')
(Python)
from __future__ import division
from sympy import divisors
def A232175(n):
n3 = n**3
ds = divisors(n3)
for i in range(len(ds)//2-1, -1, -1):
x = ds[i]
y = n3//x
a, b = divmod(y-x, 2)
if not b:
return a
return 0 # Chai Wah Wu, Sep 12 2017
(PARI) a(n) = {k = 1; while (!issquare(n^3+k^2), k++); k; } \\ Michel Marcus, Nov 20 2013
CROSSREFS
KEYWORD
nonn,look
AUTHOR
Alex Ratushnyak, Nov 19 2013
STATUS
approved