Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084810
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084810 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=1/2+I*sqrt(3). +0
12
1, 3, 5, 6, 8, 10, 13, 17, 21, 25, 31, 36, 43, 49, 57, 65, 73, 82, 92, 102, 113, 124, 136, 148, 161, 175, 189, 203, 218, 234, 250, 267, 284, 302, 320, 339, 359, 379, 399, 420, 442, 464, 487, 510, 534, 559, 584, 609, 635, 662, 689, 717, 745, 774, 804, 833, 864 (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-A084809.

Sequence in context: A022838 A047329 A120243 this_sequence A014254 A131422 A087720

Adjacent sequences: A084807 A084808 A084809 this_sequence A084811 A084812 A084813

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research