OFFSET
0,2
COMMENTS
LINKS
Andrey Zabolotskiy, Table of n, a(n) for n = 0..5000
MATHEMATICA
lpk[n_]:=Module[{k=1}, While[!IntegerQ[Sqrt[n^2+(k(k+1))/2]], k++]; k]; Array[ lpk, 70, 0] (* Harvey P. Dale, May 04 2018 *)
PROG
(Python)
import math
def a(n):
for k in range(1, max(1, 4*n-2)+1):
sum = n*n + k*(k+1)//2
r = math.isqrt(sum)
if r*r == sum:
return k
print([a(n) for n in range(70)])
(PARI) a(n) = {k = 1; while (! issquare(n^2 + k*(k+1)/2), k++); k; } \\ Michel Marcus, Nov 20 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Nov 19 2013
STATUS
approved
