cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A139693 #15 Mar 26 2019 20:01:57
%S A139693 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 A139693 145,116,87,58,29,62,31,222,185,148,111,74,37,164,123,82,41,86,43,188,
%U A139693 141,94,47,318,265,212,159,106,53,354,295,236,177,118,59,122,61,402,335
%N A139693 a(n) is the smallest positive integer m where, for k divides m, minimum(|k - m/k|) = n.
%C A139693 a(n) is the minimum positive integer m where A056737(m) = n.
%H A139693 Robert G. Wilson v, <a href="/A139693/b139693.txt">Table of n, a(n) for n = 0..10000</a>
%o A139693 (PARI) f(n) = {n=divisors(n); n[(2+#n)\2]-n[(1+#n)\2]} \\ A056737
%o A139693 a(n) = my(k=1); while(f(k) != n, k++); k; \\ _Michel Marcus_, Mar 20 2019
%Y A139693 Cf. A056737, A139694.
%K A139693 nonn
%O A139693 0,2
%A A139693 _Leroy Quet_, Apr 29 2008
%E A139693 More terms from _Max Alekseyev_, Oct 28 2008