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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084813 Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I. 3
 1, 9, 26, 84, 272, 887, 2895, 9454, 30874, 100834, 329323, 1075573, 3512840, 11472997, 37471011, 122380987 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Sequence satisfies sum(n>0,1/a(n)^z)=0 by requiring that the modulus of the successive partial sums are monotonically decreasing in magnitude for the given z. LINKS FORMULA Limit a(n+1)/a(n) --> 3.266017... - Paul D. Hanna, Jun 16 2003 PROG (PARI) S=0; w=1; a=0; for(n=1, 100, b=a+1; while(abs(S+exp(-z*log(b)))>w, b++); S=S+exp(-z*log(b)); w=abs(S); a=b; print1(b, ", ")) CROSSREFS Cf. A084812, A084814-A084818. Sequence in context: A048771 A055849 A235163 * A322764 A325585 A056409 Adjacent sequences:  A084810 A084811 A084812 * A084814 A084815 A084816 KEYWORD nonn AUTHOR Paul D. Hanna, Jun 04 2003 EXTENSIONS More terms from Paul D. Hanna, Jun 16 2003 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.

Last modified May 25 22:51 EDT 2022. Contains 354073 sequences. (Running on oeis4.)