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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084808 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=1/2+I*sqrt(2). 2

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

%S 1,4,6,8,10,13,17,21,25,31,36,43,50,57,65,73,82,92,102,113,124,136,

%T 148,161,174,188,203,218,233,249,266,283,301,319,338,358,377,398,419,

%U 440,462,485,508,532,556,581,606,632,659,686,713,741,770,799,828,859,889

%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=1/2+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-A084807, A084809-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.

Last modified April 13 02:05 EDT 2024. Contains 371639 sequences. (Running on oeis4.)