Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084807
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084807 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(1+I)/2. +0
3
1, 28, 40, 54, 69, 87, 107, 128, 152, 177, 205, 235, 267, 300, 336, 374, 414, 455, 499, 545, 593, 643, 695, 749, 805, 863, 923, 985, 1048, 1115, 1183, 1253, 1325, 1399, 1475, 1553, 1633, 1715, 1799, 1886, 1974, 2064, 2156, 2250, 2347, 2445, 2545, 2648, 2752 (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-A084806, A084808-A084810.

Sequence in context: A096430 A034964 A109798 this_sequence A047630 A135789 A154035

Adjacent sequences: A084804 A084805 A084806 this_sequence A084808 A084809 A084810

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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research