login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) is the smallest positive integer m where, for k divides m, minimum(|k - m/k|) = n.
3

%I #15 Mar 26 2019 20:01:57

%S 1,2,3,10,5,14,7,44,33,22,11,26,13,68,51,34,17,38,19,92,69,46,23,174,

%T 145,116,87,58,29,62,31,222,185,148,111,74,37,164,123,82,41,86,43,188,

%U 141,94,47,318,265,212,159,106,53,354,295,236,177,118,59,122,61,402,335

%N a(n) is the smallest positive integer m where, for k divides m, minimum(|k - m/k|) = n.

%C a(n) is the minimum positive integer m where A056737(m) = n.

%H Robert G. Wilson v, <a href="/A139693/b139693.txt">Table of n, a(n) for n = 0..10000</a>

%o (PARI) f(n) = {n=divisors(n); n[(2+#n)\2]-n[(1+#n)\2]} \\ A056737

%o a(n) = my(k=1); while(f(k) != n, k++); k; \\ _Michel Marcus_, Mar 20 2019

%Y Cf. A056737, A139694.

%K nonn

%O 0,2

%A _Leroy Quet_, Apr 29 2008

%E More terms from _Max Alekseyev_, Oct 28 2008