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

%I

%S 1,9,26,84,272,887,2895,9454,30874,100834,329323,1075573,3512840,

%T 11472997,37471011,122380987

%N Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I.

%C 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.

%F Limit a(n+1)/a(n) --> 3.266017... - _Paul D. Hanna_, Jun 16 2003

%o (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,","))

%Y Cf. A084812, A084814-A084818.

%K nonn

%O 1,2

%A _Paul D. Hanna_, Jun 04 2003

%E More terms from _Paul D. Hanna_, Jun 16 2003

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 June 28 00:25 EDT 2022. Contains 354903 sequences. (Running on oeis4.)