|
Search: id:A097988
|
|
|
| A097988 |
|
a(n)=Sum_(d dividing n){tau(d)}^3. |
|
+0
1
|
|
| 1, 9, 9, 36, 9, 81, 9, 100, 36, 81, 9, 324, 9, 81, 81, 225, 9, 324, 9, 324, 81, 81, 9, 900, 36, 81, 100, 324, 9, 729, 9, 441, 81, 81, 81, 1296, 9, 81, 81, 900, 9, 729, 9
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
When n is a prime power, we have the corollary sum_r^3={sum_r)^2, i.e. A000537(n)={A000217(n)}^2.
|
|
REFERENCES
|
J.-M. De Koninck & A.Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 562 pp. 75;265 Ellipses Paris 2004.
|
|
FORMULA
|
a(n)= {sum_(d dividing n)(tau(d)}^2 = {A007425(n)}^2.
|
|
CROSSREFS
|
Sequence in context: A076089 A046000 A003874 this_sequence A103646 A111219 A095344
Adjacent sequences: A097985 A097986 A097987 this_sequence A097989 A097990 A097991
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Sep 07 2004
|
|
|
Search completed in 0.002 seconds
|
