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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033196 n^3*Product_{p|n} (1 + 1/p). 3
1, 12, 36, 96, 150, 432, 392, 768, 972, 1800, 1452, 3456, 2366, 4704, 5400, 6144, 5202, 11664, 7220, 14400, 14112, 17424, 12696, 27648, 18750, 28392, 26244, 37632, 25230, 64800, 30752, 49152, 52272, 62424, 58800, 93312, 52022, 86640 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

Dirichlet g.f.: zeta(s-2)*zeta(s-3)/zeta(2*s-4).

a(n) = n^2*A001615(n) = n *A000082(n).

Multiplicative with a(p^e) = p^e*p^(2*e-1)*(p+1). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 16 2001

a(n)=sum_{d|n} mu(d)*sigma(n^3/d^2). - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 16 2008

PROG

(PARI) a(n)=direuler(p=2, n, (1+p^2*X)/(1-p^3*X))[n]

(PARI) a(n)=sumdiv(n, d, moebius(d)*sigma(n^3/d^2)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 16 2008

CROSSREFS

Sequence in context: A049598 A152135 A080562 * A172218 A172212 A060621

Adjacent sequences:  A033193 A033194 A033195 * A033197 A033198 A033199

KEYWORD

nonn,easy,mult

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Additional comments from Michael Somos, May 19, 2000.

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 20:13 EST 2012. Contains 205663 sequences.