The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084814 Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2. 3

%I

%S 1,4,8,17,37,82,185,419,952,2166,4932,11234,25593

%N Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2.

%C Sequence satisfies Sum_{n>=1} 1/a(n)^z = 0 by requiring that the modulus of the successive partial sums are monotonically decreasing in magnitude for the given z.

%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-A084813, A084815-A084818.

%K nonn,more

%O 1,2

%A _Paul D. Hanna_, Jun 04 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 May 27 07:25 EDT 2022. Contains 354093 sequences. (Running on oeis4.)