login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139693 a(n) is the smallest positive integer m where, for k divides m, minimum(|k - m/k|) = n. 3
1, 2, 3, 10, 5, 14, 7, 44, 33, 22, 11, 26, 13, 68, 51, 34, 17, 38, 19, 92, 69, 46, 23, 174, 145, 116, 87, 58, 29, 62, 31, 222, 185, 148, 111, 74, 37, 164, 123, 82, 41, 86, 43, 188, 141, 94, 47, 318, 265, 212, 159, 106, 53, 354, 295, 236, 177, 118, 59, 122, 61, 402, 335 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

Robert G. Wilson v, Table of n, a(n) for n = 0..10000

PROG

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

a(n) = my(k=1); while(f(k) != n, k++); k; \\ Michel Marcus, Mar 20 2019

CROSSREFS

Cf. A056737, A139694.

Sequence in context: A230625 A048985 A112417 * A182076 A266552 A263716

Adjacent sequences:  A139690 A139691 A139692 * A139694 A139695 A139696

KEYWORD

nonn

AUTHOR

Leroy Quet, Apr 29 2008

EXTENSIONS

More terms from Max Alekseyev, Oct 28 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 22:47 EDT 2019. Contains 328315 sequences. (Running on oeis4.)