OFFSET
2,1
COMMENTS
The function m(k) is a monotonically increasing function of k if n is held constant. Therefore the implementation may scan k upwards until the first integer m is found. - R. J. Mathar, Aug 07 2014
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 2..250
MAPLE
A066256 := proc(n)
local k, f ;
for k from 1 do
f := (k^2+n)/(n^2+k) ;
if f > 1 and type(f, 'integer') then
return k;
end if;
end do:
end proc: # R. J. Mathar, Aug 07 2014
MATHEMATICA
Do[k = 1; While[m = (k^2 + n)/(n^2 + k); !IntegerQ[m] || m == 1, k++ ]; Print[k], {n, 2, 75} ]
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Dec 31 2001
EXTENSIONS
More terms from Robert G. Wilson v, Jan 03 2002
STATUS
approved