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!)
A084801 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(12+I*5)/13. 2

%I #4 Mar 30 2012 18:36:38

%S 1,62,65,69,72,76,80,83,87,90,94,98,101,105,109,113,116,120,124,128,

%T 131,135,139,143,147,150,154,158,162,166,169,173,177,181,185,189,193,

%U 197,201,204,208,212,216,220,224,228,232,236,240,244,248,252,256,260,264

%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(12+I*5)/13.

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

%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. A084589, A084799-A084800, A084802-A084810.

%K nonn

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 31 22:14 EDT 2024. Contains 375574 sequences. (Running on oeis4.)