|
Search: id:A062355
|
|
|
| A062355 |
|
d(n)* phi(n), where d(n) is the number of divisors function. |
|
+0
4
|
|
| 1, 2, 4, 6, 8, 8, 12, 16, 18, 16, 20, 24, 24, 24, 32, 40, 32, 36, 36, 48, 48, 40, 44, 64, 60, 48, 72, 72, 56, 64, 60, 96, 80, 64, 96, 108, 72, 72, 96, 128, 80, 96, 84, 120, 144, 88, 92, 160, 126, 120, 128, 144, 104, 144, 160, 192, 144, 112, 116, 192, 120, 120, 216, 224
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
D. M. Burton, Elementary Number Theory, Allyn and Bacon Inc., Boston MA, 1976, Prob. 7.2 12, p. 141.
|
|
MAPLE
|
seq(tau(n)*phi(n), n=1..64); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 22 2007
|
|
PROGRAM
|
(PARI) a(n)=numdiv(n)*eulerphi(n); vector(150, n, a(n))
|
|
CROSSREFS
|
Cf. A062816, A079535.
Sequence in context: A107634 A060659 A063199 this_sequence A087671 A088308 A134488
Adjacent sequences: A062352 A062353 A062354 this_sequence A062356 A062357 A062358
|
|
KEYWORD
|
easy,nonn,mult
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 06 2001
|
|
|
Search completed in 0.002 seconds
|
