|
%I #4 Mar 30 2012 18:36:38
%S 1,8,12,16,21,27,33,41,49,58,67,78,89,102,114,128,143,158,174,191,208,
%T 227,246,266,286,308,330,353,377,402,427,454,481,508,537,566,597,627,
%U 659,692,725,759,794,829,866,903,941,980,1019,1060,1101,1143,1185,1229
%N Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(1+I*sqrt(3))/2.
%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. A084799-A084808, A084810.
%K nonn
%O 1,2
%A _Paul D. Hanna_, Jun 04 2003
|
