The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A069194 a(n) = Sum_{d|n} (n/d)*phi(n)/phi(d). 1
 1, 3, 7, 13, 21, 21, 43, 53, 64, 63, 111, 91, 157, 129, 147, 213, 273, 192, 343, 273, 301, 333, 507, 371, 526, 471, 577, 559, 813, 441, 931, 853, 777, 819, 903, 832, 1333, 1029, 1099, 1113, 1641, 903, 1807, 1443, 1344, 1521, 2163, 1491, 2108, 1578, 1911, 2041 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 FORMULA Multiplicative with a(p^e) = p^e*(p^e - p^(e-1)) + (p^(2*e) - 1)/(p^2 - 1). - Amiram Eldar, Sep 15 2019 MAPLE for i from 1 to 100 do d := divisors(i): a[i] := i*phi(i)*sum(1/d[j]/phi(d[j]), j=1..nops(d)) od:seq(a[j], j=1..100); MATHEMATICA f[p_, e_] := p^e*(p^e - p^(e-1)) + (p^(2*e) - 1)/(p^2 - 1) ; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Sep 15 2019 *) PROG (MAGMA) [&+[(n div d)*EulerPhi(n) div EulerPhi(d):d in Divisors(n)]:n in [1..52]]; // Marius A. Burtea, Sep 15 2019 (PARI) a(n) = sumdiv(n, d, n/d*eulerphi(n)/eulerphi(d)); \\ Michel Marcus, Sep 15 2019 CROSSREFS Cf. A000010. Sequence in context: A033154 A076950 A169633 * A100531 A032409 A073896 Adjacent sequences:  A069191 A069192 A069193 * A069195 A069196 A069197 KEYWORD mult,easy,nonn AUTHOR Vladeta Jovovic, Apr 10 2002 EXTENSIONS More terms from Sascha Kurz, Jan 03 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 September 25 12:23 EDT 2020. Contains 337343 sequences. (Running on oeis4.)