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!)
A084816 Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I*2. 3
1, 3, 6, 13, 39, 131, 448, 1547, 5352, 18524, 64125, 221990, 768506, 2660499, 9210416, 31885663, 110385418, 382144818, 1322952481 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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.
LINKS
FORMULA
Limit a(n+1)/a(n) --> 3.4619139...
PROG
(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, ", "))
CROSSREFS
Sequence in context: A216999 A036781 A370208 * A055738 A301656 A359669
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jun 04 2003
STATUS
approved

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 20 18:17 EDT 2024. Contains 375338 sequences. (Running on oeis4.)