Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084800
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084800 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(4+I*3)/5. +0
3
1, 16, 18, 21, 25, 28, 31, 34, 38, 41, 44, 48, 52, 55, 59, 63, 67, 71, 75, 79, 83, 87, 91, 95, 99, 104, 108, 112, 116, 121, 125, 130, 134, 139, 143, 148, 152, 157, 162, 166, 171, 176, 180, 185, 190, 195, 200, 205, 209, 214, 219, 224, 229, 234, 239, 244, 249, 255, 260 (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, A084801-A084810.

Sequence in context: A077914 A161874 A095953 this_sequence A065426 A031168 A097746

Adjacent sequences: A084797 A084798 A084799 this_sequence A084801 A084802 A084803

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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research