Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084839
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A084839
%S A084839 1,2,3,5,62,66,69,73,77,83,87,89,91,97,106,110,111,113,115,127,142,149,
%T A084839 158,163,166,167,177,190,194,197,201,211,221,223,226,229,235,246,253,
%U A084839 255,259,266,274,281,287,293,295,307,321,331,341,345,355,366,371,373
%N A084839 Smallest integers that satisfy sum(n>0, mu(a(n))*log(a(n))/a(n))=-1 by 
               requiring that the absolute values of 1 + the successive partial 
               sums are monotonically decreasing in magnitude, where a(1)=1 and 
               a(n+1)>a(n) for n>0.
%C A084839 Since sum(n>0,mu(n)*log(n)/n)=-1, this sequence gives a subset of integers 
               that satisfy this sum.
%o A084839 (PARI) S=0; a=0; w=2; for(n=1,200,b=a+1; while(abs(S+moebius(b)*log(b)/
               b+1)>=w,b++); S=S+moebius(b)*log(b)/b; w=abs(S+1); a=b; print1(b,
               ","))
%Y A084839 Cf. A084838.
%Y A084839 Sequence in context: A136340 A029961 A083665 this_sequence A103110 A042239 
               A029975
%Y A084839 Adjacent sequences: A084836 A084837 A084838 this_sequence A084840 A084841 
               A084842
%K A084839 nonn
%O A084839 1,2
%A A084839 Paul D. Hanna (pauldhanna(AT)juno.com), Jun 06 2003

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research