|
Search: id:A029935
|
|
|
| A029935 |
|
Sum phi(d)*phi(n/d); d divides n. |
|
+0
10
|
|
| 1, 2, 4, 5, 8, 8, 12, 12, 16, 16, 20, 20, 24, 24, 32, 28, 32, 32, 36, 40, 48, 40, 44, 48, 56, 48, 60, 60, 56, 64, 60, 64, 80, 64, 96, 80, 72, 72, 96, 96, 80, 96, 84, 100, 128, 88, 92, 112, 120, 112, 128, 120, 104, 120
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Sum_{d|n} a_d = A018804(n). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Nov 19 2004
|
|
FORMULA
|
Sum_{k=1..n} phi(gcd(n, k)). Multiplicative with a(p^e) = (e+1)*(p^e - p^(e - 1)) - (e - 1)*(p^(e - 1) - p^(e - 2)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Oct 30 2001
Dirichlet g.f.: zeta(s-1)^2/zeta(s)^2. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Nov 19 2004
Equals A051731 (inverse Mobius transform) of A018804: (1, 3, 5, 8, 9, 15, 13,...); and row sums of triangle A143258. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 02 2008]
|
|
MAPLE
|
with(numtheory): A029935 := proc(n) local i, j; j := 0; for i in divisors(n) do j := j+phi(i)*phi(n/i); od; j; end;
|
|
CROSSREFS
|
Cf. A029936.
Sequence in context: A036694 A085624 A061884 this_sequence A123291 A099402 A117070
Adjacent sequences: A029932 A029933 A029934 this_sequence A029936 A029937 A029938
|
|
KEYWORD
|
mult,nonn,new
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
