%I A086824
%S A086824 1,4,7,9,12,14,17,20,22,25,28,30,33,36,38,41,44,47,49,52,55,57,60,63,65,
%T A086824 68,71,73,76,79,82,84,87,90,92,95,98,101,103,106,109,111,114,117,119,
%U A086824 122,125,128,130,133,136,138,141,144,147,149,152,155,157,160,163,166
%N A086824 Least k such that k!>=n^k.
%C A086824 Suggested by Richard-Andre Jeannin (andre-jeannin.richard(AT)wanadoo.fr)
%F A086824 a(n) = e*n + O(log(n)); a(n+1)-a(n) = 2 or 3
%F A086824 Conjecture : for n>3 a(n)=round(e*n-(1/2)*log(2*pi*n)-1/n) - Benoit Cloitre 
               (benoit7848c(AT)orange.fr), Dec 14 2005
%t A086824 f[n_] := Block[{k = 1}, While[k! < n^k, k++ ]; k]; Table[ f[n], {n, 62}] 
               (from Robert G. Wilson v Jun 12 2004)
%o A086824 (PARI) a(n)=if(n<2,1,k=1; while(k!<n^k,k++); k)
%Y A086824 Variant of A065027. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Sep 12 2008]
%Y A086824 Sequence in context: A092861 A007072 A007064 this_sequence A080574 A007066 
               A047537
%Y A086824 Adjacent sequences: A086821 A086822 A086823 this_sequence A086825 A086826 
               A086827
%K A086824 nonn
%O A086824 0,2
%A A086824 Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 07 2003