Search: id:A063473
Results 1-1 of 1 results found.

%I A063473
%S A063473 1,1,2,2,2,2,3,1,2,3,2,2,2,1,2,4,3,1,2,0,1,3,3,3,3,2,3,2,1,1,2,1,0,2,1,
%T A063473 3,4,3,2,4,4,4,3,1,2,1,0,2,1,1,0,2,3,3,4,4,5,5,5,3,3,1,1,2,1,3,2,1,2,4,
%U A063473 3,1,0,1,0,1,1,1,2,0,1,0,1,1,1,2,3,4,3,3,4,4,3,3,3,5,6,6,7,8,7,5,4,3,2
%V A063473 1,-1,-2,-2,-2,-2,-3,-1,-2,-3,-2,-2,-2,-1,-2,-4,-3,-1,-2,0,-1,-3,-3,-3,
               -3,-2,-3,-2,-1,
%W A063473 -1,-2,-1,0,-2,-1,-3,-4,-3,-2,-4,-4,-4,-3,-1,-2,-1,0,2,1,1,0,-2,-3,-3,
               -4,-4,-5,-5,-5,
%X A063473 -3,-3,-1,-1,-2,-1,-3,-2,-1,-2,-4,-3,-1,0,1,0,-1,-1,-1,-2,0,1,0,-1,-1,
               -1,-2,-3,-4,-3
%N A063473 M(2*n-1), where M(n) is Mertens' function (A002321): Sum_{1<=k<=n} mu(k), 
               where mu = Moebius function (A008683).
%H A063473 Harry J. Smith, <a href="b063473.txt">Table of n, a(n) for n=1,...,1000</
               a>
%o A063473 (PARI) M(n)=sum(k=1,n,moebius(k)); j=[]; for(n=1,200,j=concat(j,M(2*n-1))); 
               j
%o A063473 (PARI) { for (n=1, 1000, if (n>1, a+=moebius(2*n - 2) + moebius(2*n - 
               1), a=1); write("b063473.txt", n, " ", a) ) } [From Harry J. Smith 
               (hjsmithh(AT)sbcglobal.net), Aug 22 2009]
%Y A063473 Cf. A002321, A008683.
%Y A063473 Sequence in context: A057331 A067089 A090872 this_sequence A096859 A005086 
               A157372
%Y A063473 Adjacent sequences: A063470 A063471 A063472 this_sequence A063474 A063475 
               A063476
%K A063473 easy,sign
%O A063473 1,3
%A A063473 Jason Earls (zevi_35711(AT)yahoo.com), Jul 27 2001

Search completed in 0.001 seconds