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

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

%S 1,11,14,17,20,24,27,31,35,39,44,48,52,57,62,67,72,77,82,87,93,98,104,

%T 109,115,121,127,133,139,145,151,158,164,170,177,184,190,197,204,211,

%U 218,225,232,239,246,254,261,268,276,283,291,299,306,314,322,330,338

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

%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. A084799-A084804, A084806-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 May 3 12:13 EDT 2024. Contains 372209 sequences. (Running on oeis4.)