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

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

%S 1,28,40,54,69,87,107,128,152,177,205,235,267,300,336,374,414,455,499,

%T 545,593,643,695,749,805,863,923,985,1048,1115,1183,1253,1325,1399,

%U 1475,1553,1633,1715,1799,1886,1974,2064,2156,2250,2347,2445,2545,2648,2752

%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(1+I)/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-A084806, A084808-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 February 20 21:52 EST 2024. Contains 370219 sequences. (Running on oeis4.)