Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084815
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084815 Least integers that satisfy sum(n>0,1/a(n)^z)=0, where a(1)=1, a(n+1)>a(n) and z=I*Pi/4. +0
3
1, 15, 57, 226, 896, 3556, 14114 (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. A084812-A084814, A084816-A084818.

Sequence in context: A140379 A020222 A158482 this_sequence A012691 A020187 A022287

Adjacent sequences: A084812 A084813 A084814 this_sequence A084816 A084817 A084818

KEYWORD

more,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 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research