Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084804
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084804 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61. +0
4
1, 6072, 6078, 6084, 6091, 6097, 6104, 6110, 6116, 6123, 6129, 6136, 6142, 6148, 6155, 6161, 6168, 6174, 6180, 6187, 6193, 6200, 6206, 6212, 6219, 6225, 6232, 6238, 6244, 6251, 6257, 6264, 6270, 6276, 6283, 6289, 6296, 6302, 6308, 6315, 6321, 6328 (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.

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. A084589, A084799-A084803, A084805-A084810.

Sequence in context: A064248 A157652 A157267 this_sequence A025515 A031666 A031576

Adjacent sequences: A084801 A084802 A084803 this_sequence A084805 A084806 A084807

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 04 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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research