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”).
%I #4 Mar 30 2012 18:36:38
%S 1,16,18,21,25,28,31,34,38,41,44,48,52,55,59,63,67,71,75,79,83,87,91,
%T 95,99,104,108,112,116,121,125,130,134,139,143,148,152,157,162,166,
%U 171,176,180,185,190,195,200,205,209,214,219,224,229,234,239,244,249,255,260
%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(4+I*3)/5.
%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, A084801-A084810.
%K nonn
%O 1,2
%A _Paul D. Hanna_, Jun 04 2003