Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084805
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084805 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(1+I)/sqrt(2). +0
3
1, 11, 14, 17, 20, 24, 27, 31, 35, 39, 44, 48, 52, 57, 62, 67, 72, 77, 82, 87, 93, 98, 104, 109, 115, 121, 127, 133, 139, 145, 151, 158, 164, 170, 177, 184, 190, 197, 204, 211, 218, 225, 232, 239, 246, 254, 261, 268, 276, 283, 291, 299, 306, 314, 322, 330, 338 (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-A084804, A084806-A084810.

Sequence in context: A025058 A025060 A093669 this_sequence A015830 A114948 A077675

Adjacent sequences: A084802 A084803 A084804 this_sequence A084806 A084807 A084808

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research