This site is supported by donations to The OEIS Foundation.

 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

%I

%S 1,2,3,10,21,50,55,78,105,136,171,242,253,338,351,406,465,578,595,666,

%T 741,820,903,1058,1081,1250,1275,1378,1653,1682,1711,1830,1953,2178,

%U 2211,2556,2701,2738,2775,2926,3081,3362,3403,3698,3741,3916,4232,4418,4465

%N 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).

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

%o 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

%Y Cf. A056737, A139693.

%K nonn

%O 0,2

%A _Leroy Quet_, Apr 29 2008

%E More terms from _Michel Marcus_, Feb 11 2014

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.

Last modified September 19 11:05 EDT 2019. Contains 327192 sequences. (Running on oeis4.)