login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176030 a(n) = n^(sigma_2(n)). 0
1, 32, 59049, 4398046511104, 1490116119384765625, 808281277464764060643139600456536293376, 1798465042647412146620280340569649349251249 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
sigma_2 = A001157 is the sum of squares of divisors of n.
LINKS
FORMULA
a(n) = n^A001157(n).
EXAMPLE
a(1) = 1^1 = 1.
a(2) = 2^(1+4) = 32.
a(3) = 3^(1+9) = 59049.
MATHEMATICA
Table[n^DivisorSigma[2, n], {n, 20}]
CROSSREFS
Sequence in context: A054374 A221138 A017009 * A034245 A230566 A017093
KEYWORD
nonn,easy
AUTHOR
Michel Lagneau, Apr 06 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 11:41 EST 2023. Contains 367656 sequences. (Running on oeis4.)