The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #10 Apr 11 2021 03:01:46
%S 1,4,8,17,37,82,185,419,952,2166,4932,11234,25593
%N Least integers that satisfy Sum_{n>=1} 1/a(n)^z = 0, where a(1)=1, a(n+1) > a(n) and z = i*Pi/2.
%C Sequence satisfies Sum_{n>=1} 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. A084812-A084813, A084815-A084818.
%K nonn,more
%O 1,2
%A _Paul D. Hanna_, Jun 04 2003