%I A038199
%S A038199 1,2,6,12,30,54,126,240,504,990,2046,4020,8190,16254,32730,65280,131070,
%T A038199 261576,524286,1047540,2097018,4192254,8388606,16772880,33554400,
%U A038199 67100670,134217216,268419060,536870910,1073708010,2147483646
%N A038199 Row sums of triangle T(m,n) = number of solutions to 1 <= a(1)<a(2)<...<a(m) 
               <= n, where gcd( a(1), a(2), ....a(m), n)=1, in A020921.
%C A038199 The function T(m,n) described above has an inverse: see A038200.
%C A038199 Also, Moebius transform of 2^n - 1 = A000225. Also, number of rationals 
               in [0, 1) whose binary expansions consist just of repeating bits 
               of (least) period exactly n (i.e., there's no preperiodic part), 
               where 0 = 0.000... is considered to have period 1. - Brad Chalfan 
               (brad(AT)chalfan.net), May 29 2006
%D A038199 Temba Shonhiwa, A Generalization of the Euler and Jordan Totient Functions, 
               Fib. Quart., 37 (1999), 67-76.
%F A038199 a(n)=sum mu(n/d)(2^d-1), d divides n. - Paul Barry (pbarry(AT)wit.ie), 
               Mar 20 2005
%t A038199 Table[Plus@@((2^Divisors[n]-1)MoebiusMu[n/Divisors[n]]),{n,1,31}] - Brad 
               Chalfan (brad(AT)chalfan.net), May 29 2006
%Y A038199 Cf. A038200, A020921, A023995. Essentially same as A027375.
%Y A038199 Cf. A056267.
%Y A038199 Cf. A000225.
%Y A038199 Sequence in context: A143176 A081375 A024701 this_sequence A056267 A133996 
               A080742
%Y A038199 Adjacent sequences: A038196 A038197 A038198 this_sequence A038200 A038201 
               A038202
%K A038199 nonn,easy,nice
%O A038199 1,2
%A A038199 Temba Shonhiwa (Temba(AT)maths.uz.ac.zw)
%E A038199 Better description from Michael Somos
%E A038199 More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Sep 10 2001
%E A038199 More terms from Brad Chalfan (brad(AT)chalfan.net), May 29 2006