%I #4 Mar 30 2012 18:36:38
%S 1,6072,6078,6084,6091,6097,6104,6110,6116,6123,6129,6136,6142,6148,
%T 6155,6161,6168,6174,6180,6187,6193,6200,6206,6212,6219,6225,6232,
%U 6238,6244,6251,6257,6264,6270,6276,6283,6289,6296,6302,6308,6315,6321,6328
%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.
%C 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.
%o (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,","))
%Y Cf. A084589, A084799-A084803, A084805-A084810.
%K nonn
%O 1,2
%A _Paul D. Hanna_, Jun 04 2003