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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139694 a(0)=1. a(n) = smallest positive integer m, m > a(n-1), where, for k divides m, minimum(|k -m/k|) = n. a(n) = the minimum positive integer m where A056737(m) = n and m > a(n-1). 1
1, 2, 3, 10, 21, 50, 55, 78, 105, 136, 171, 242, 253, 338, 351, 406, 465, 578, 595, 666, 741, 820, 903, 1058, 1081, 1250, 1275, 1378, 1653, 1682, 1711, 1830, 1953, 2178, 2211, 2556, 2701, 2738, 2775, 2926, 3081, 3362, 3403, 3698, 3741, 3916, 4232, 4418, 4465 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..48.

PROG

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

lista(nn) = {olda = 1; for (n=1, nn+1, print1(olda, ", "); newa = olda + 1; while (a056737(newa) != n, newa++); olda = newa; ); } \\ Michel Marcus, Feb 11 2014

CROSSREFS

Cf. A056737, A139693.

Sequence in context: A225477 A079161 A069565 * A064497 A161522 A120484

Adjacent sequences:  A139691 A139692 A139693 * A139695 A139696 A139697

KEYWORD

nonn

AUTHOR

Leroy Quet, Apr 29 2008

EXTENSIONS

More terms from Michel Marcus, Feb 11 2014

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 August 23 13:58 EDT 2019. Contains 326229 sequences. (Running on oeis4.)