The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A084801 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A084801

Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(12+I*5)/13.
(history; published version)

#4 by Russ Cox at Fri Mar 30 18:36:38 EDT 2012

AUTHOR

_Paul D. Hanna (pauldhanna(AT)juno.com), _, Jun 04 2003

Discussion

Fri Mar 30

18:36

OEIS Server: https://oeis.org/edit/global/213

#3 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007

KEYWORD

nonn,new

nonn

AUTHOR

Paul D . Hanna (pauldhanna(AT)juno.com), Jun 04 2003

#2 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004

PROG

(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, ", "))

KEYWORD

nonn,new

nonn

#1 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003

NAME

Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(12+I*5)/13.

DATA

1, 62, 65, 69, 72, 76, 80, 83, 87, 90, 94, 98, 101, 105, 109, 113, 116, 120, 124, 128, 131, 135, 139, 143, 147, 150, 154, 158, 162, 166, 169, 173, 177, 181, 185, 189, 193, 197, 201, 204, 208, 212, 216, 220, 224, 228, 232, 236, 240, 244, 248, 252, 256, 260, 264

OFFSET

1,2

COMMENTS

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.

PROG

(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-A084800, A084802-A084810.

KEYWORD

nonn

AUTHOR

Paul D Hanna (pauldhanna(AT)juno.com), Jun 04 2003

STATUS

approved