Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084808
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084808 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=1/2+I*sqrt(2). +0
3
1, 4, 6, 8, 10, 13, 17, 21, 25, 31, 36, 43, 50, 57, 65, 73, 82, 92, 102, 113, 124, 136, 148, 161, 174, 188, 203, 218, 233, 249, 266, 283, 301, 319, 338, 358, 377, 398, 419, 440, 462, 485, 508, 532, 556, 581, 606, 632, 659, 686, 713, 741, 770, 799, 828, 859, 889 (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-A084807, A084809-A084810.

Adjacent sequences: A084805 A084806 A084807 this_sequence A084809 A084810 A084811

Sequence in context: A073670 A090169 A087684 this_sequence A031020 A087270 A075124

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research