# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a145913
Showing 1-1 of 1

%I A145913 #24 May 09 2021 05:06:01
%S A145913 1,3,6,10,14,18,22,27,32,37,42,47,52,57,63,68,74,79,85,91,97,102,108,
%T A145913 114,120,126,133,139,145,151,157,164,170,176,183,189,196,202,209,216,
%U A145913 222,229,235,242,249,256,262,269,276,283,290,297,304,310,317,324,331
%N A145913 a(n) = smallest integer k such that 1/log((1 + k)^(1/k)) is bigger than n.
%C A145913 Note that 1/log((1 + k)^(1/k)) = 1/Hypergeometric2F1(1,1,2,-z).
%C A145913 Smallest positive integer k such that k > n*log(1 + k). - _Peter Munn_, Mar 21 2017
%H A145913 Charles R Greathouse IV, <a href="/A145913/b145913.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Indranil Ghosh)
%F A145913 a(n) ~ n log n. - _Charles R Greathouse IV_, Mar 24 2017
%t A145913 a = {}; k = 1; Do[If[N[((1/n) Log[1 + n])^(-1)] > k, AppendTo[a, n]; k = k + 1], {n, 1, 1010}]; a
%o A145913 (PARI) a(n) = {my(k=1); while(1, if((1/log((1 + k)^(1/k))) > n, return (k), k++));};
%o A145913 for(n=1, 100, print1(a(n),", ")) \\ _Indranil Ghosh_, Mar 23 2017
%o A145913 (PARI) a(n)=my(k=solve(x=n*log(n),n^2,n*log(x+1)-x)\1); while(k <= n*log(k+1), k++); k \\ _Charles R Greathouse IV_, Mar 24 2017
%o A145913 (Python)
%o A145913 import math
%o A145913 def a(n):
%o A145913     k=1
%o A145913     while True:
%o A145913         if (1/math.log((1 + k)**(1/k))) > n: return k
%o A145913         else: k+=1
%o A145913 print([a(n) for n in range(1, 101)]) # _Indranil Ghosh_, Mar 23 2017
%Y A145913 Cf. A145914.
%K A145913 nonn
%O A145913 1,2
%A A145913 _Artur Jasinski_, Oct 24 2008

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE