Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084802
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084802 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(24+i*7)/25. +0
3
1, 276, 280, 285, 289, 294, 298, 303, 307, 312, 316, 321, 325, 330, 334, 339, 343, 348, 352, 357, 361, 366, 370, 375, 379, 384, 388, 393, 397, 402, 406, 411, 415, 420, 425, 429, 434, 438, 443, 447, 452, 456, 461, 466, 470, 475, 479, 484, 488, 493, 498, 502 (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, A084803-A084810.

Sequence in context: A133536 A075666 A121743 this_sequence A003903 A131884 A008892

Adjacent sequences: A084799 A084800 A084801 this_sequence A084803 A084804 A084805

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 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research