Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084813
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084813 Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I. +0
3
1, 9, 26, 84, 272, 887, 2895, 9454, 30874, 100834, 329323, 1075573, 3512840, 11472997, 37471011, 122380987 (list; graph; listen)
OFFSET

1,2

COMMENT

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.

FORMULA

Limit a(n+1)/a(n) --> 3.266017... - Paul D. Hanna (pauldhanna(AT)juno.com), Jun 16 2003

PROGRAM

(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

Cf. A084812, A084814-A084818.

Sequence in context: A048468 A048771 A055849 this_sequence A056409 A056399 A135864

Adjacent sequences: A084810 A084811 A084812 this_sequence A084814 A084815 A084816

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 04 2003

EXTENSIONS

More terms from Paul D. Hanna (pauldhanna(AT)juno.com), Jun 16 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research