This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084809 Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(1+I*sqrt(3))/2. 3
 1, 8, 12, 16, 21, 27, 33, 41, 49, 58, 67, 78, 89, 102, 114, 128, 143, 158, 174, 191, 208, 227, 246, 266, 286, 308, 330, 353, 377, 402, 427, 454, 481, 508, 537, 566, 597, 627, 659, 692, 725, 759, 794, 829, 866, 903, 941, 980, 1019, 1060, 1101, 1143, 1185, 1229 (list; graph; refs; listen; history; text; internal format)
 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. LINKS 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 Cf. A084799-A084808, A084810. Sequence in context: A160392 A242272 A078609 * A186407 A190037 A110558 Adjacent sequences:  A084806 A084807 A084808 * A084810 A084811 A084812 KEYWORD nonn AUTHOR Paul D. Hanna, Jun 04 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 08:18 EST 2018. Contains 318090 sequences. (Running on oeis4.)