login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062380 a(n) = Sum_{i|n,j|n} phi(i)*phi(j)/phi(gcd(i,j)), where phi is Euler totient function. 3
1, 4, 7, 14, 13, 28, 19, 42, 37, 52, 31, 98, 37, 76, 91, 114, 49, 148, 55, 182, 133, 124, 67, 294, 113, 148, 163, 266, 85, 364, 91, 290, 217, 196, 247, 518, 109, 220, 259, 546, 121, 532, 127, 434, 481, 268, 139, 798, 229, 452, 343, 518, 157, 652, 403, 798, 385 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Multiplicative with a(p^e) = 1+ sum_{k=1..e} (2k+1)(p^k-p^{k-1}) = ((2e+1)p^(e+1)-(2e+3)p^e+2)/(p-1) Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu) May 24, 2005.

FORMULA

a(n) = Sum_{d|n} phi(d)*tau(d^2).

CROSSREFS

Cf. A000005, A000010, A060648.

Sequence in context: A074862 A101064 A055675 * A072031 A007437 A159912

Adjacent sequences:  A062377 A062378 A062379 * A062381 A062382 A062383

KEYWORD

nonn,mult

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 07 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:47 EST 2012. Contains 205623 sequences.