login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111334 a(n) is the smallest integer k such that the difference between the arithmetic and geometric means of the first k positive integers is larger than 10^n. 0
11, 81, 765, 7581, 75703, 756903, 7568866, 75688472, 756884504, 7568844796, 75688447681, 756884476508, 7568844764750, 75688447647137, 756884476470980, 7568844764709381, 75688447647093366, 756884476470933182 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
By using the approximation formula k! = (k/e)^k one can show that a(n) will be approximately 7.56*10^n.
LINKS
FORMULA
a(n) = Min_{k: (k+1)/2 - (k!)^(1/k) > 10^n}.
EXAMPLE
(80+1)/2 - (80!)^(1/80) = 9.9026... < 10^1 < 10.032... = (81+1)/2 - (81!)^(1/81)
So 81 is the smallest k where the required difference exceeds 10, thus a(1) = 81.
PROG
(PARI) f(n)=return(log(sqrt(2*Pi))+(n+0.5)*log(n)-n+1/(12*n)) for(k=0, 24, n=0; forstep(i=4*k+8, 0, -1, m=n+2^i; \ if(f(m)>m*log((m+1)/2-10^k), n=m)); print1(n+1, ", ")) \\ Robert Gerbicz, Aug 24 2006
CROSSREFS
Sequence in context: A003730 A334340 A335332 * A085879 A239459 A197643
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Robert Gerbicz, Aug 24 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 20:12 EDT 2024. Contains 372316 sequences. (Running on oeis4.)