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

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

%S 1,276,280,285,289,294,298,303,307,312,316,321,325,330,334,339,343,

%T 348,352,357,361,366,370,375,379,384,388,393,397,402,406,411,415,420,

%U 425,429,434,438,443,447,452,456,461,466,470,475,479,484,488,493,498,502

%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(24+i*7)/25.

%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-A084801, A084803-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 June 29 07:27 EDT 2024. Contains 373826 sequences. (Running on oeis4.)