|
Search: id:A035116
|
|
| |
|
| 1, 4, 4, 9, 4, 16, 4, 16, 9, 16, 4, 36, 4, 16, 16, 25, 4, 36, 4, 36, 16, 16, 4, 64, 9, 16, 16, 36, 4, 64, 4, 36, 16, 16, 16, 81, 4, 16, 16, 64, 4, 64, 4, 36, 36, 16, 4, 100, 9, 36, 16, 36, 4, 64, 16, 64, 16, 16, 4, 144, 4, 16
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
tau(n)^2 = Sum_{d|n} tau(d^2), cf. A061391.
|
|
REFERENCES
|
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, Theorem 304.
|
|
FORMULA
|
Dirichlet g.f.: zeta(s)^4/zeta(2s).
Multiplicative with a(p^e) = (e+1)^2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 03 2001
|
|
PROGRAM
|
(MAGMA) [ NumberOfDivisors(n)^2 : n in [1..100] ];
|
|
CROSSREFS
|
Cf. A000005, A048691, A061391.
Sequence in context: A137617 A023405 A160900 this_sequence A088613 A049723 A010661
Adjacent sequences: A035113 A035114 A035115 this_sequence A035117 A035118 A035119
|
|
KEYWORD
|
nonn,easy,mult
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Additional comments from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 29 2001
|
|
|
Search completed in 0.002 seconds
|
