cp's OEIS Frontend

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

%I A139694 #7 Feb 11 2014 02:48:36
%S A139694 1,2,3,10,21,50,55,78,105,136,171,242,253,338,351,406,465,578,595,666,
%T A139694 741,820,903,1058,1081,1250,1275,1378,1653,1682,1711,1830,1953,2178,
%U A139694 2211,2556,2701,2738,2775,2926,3081,3362,3403,3698,3741,3916,4232,4418,4465
%N 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).
%o A139694 (PARI) a056737(n)={n=divisors(n); n[(2+#n)\2]-n[(1+#n)\2];} \\ from A056737
%o A139694 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 A139694 Cf. A056737, A139693.
%K A139694 nonn
%O A139694 0,2
%A A139694 _Leroy Quet_, Apr 29 2008
%E A139694 More terms from _Michel Marcus_, Feb 11 2014