login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A084804
Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.
3
1, 6072, 6078, 6084, 6091, 6097, 6104, 6110, 6116, 6123, 6129, 6136, 6142, 6148, 6155, 6161, 6168, 6174, 6180, 6187, 6193, 6200, 6206, 6212, 6219, 6225, 6232, 6238, 6244, 6251, 6257, 6264, 6270, 6276, 6283, 6289, 6296, 6302, 6308, 6315, 6321, 6328
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
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jun 04 2003
STATUS
approved