Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084806
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084806 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=1/2 + I. +0
3
1, 6, 9, 12, 16, 20, 25, 31, 37, 43, 50, 58, 66, 75, 84, 94, 104, 115, 127, 139, 152, 165, 179, 193, 208, 223, 239, 256, 273, 290, 309, 327, 347, 367, 387, 408, 430, 452, 475, 498, 522, 546, 571, 596, 622, 649, 676, 704, 732, 761, 790, 820, 851, 882, 913, 945 (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. A084799-A084805, A084807-A084810.

Sequence in context: A130699 A023040 A001474 this_sequence A020938 A136360 A023483

Adjacent sequences: A084803 A084804 A084805 this_sequence A084807 A084808 A084809

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research