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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132650 Number of divisors of n, d(n) raised to power d(n). 1
1, 4, 4, 27, 4, 256, 4, 256, 27, 256, 4, 46656, 4, 256, 256, 3125, 4, 46656, 4, 46656, 256, 256, 4, 16777216, 27, 256, 256, 46656, 4, 16777216, 4, 46656, 256, 256, 256, 387420489, 4, 256, 256, 16777216, 4, 16777216, 4, 46656, 46656, 256, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..1024

FORMULA

a(n) = d(n)^d(n), where d(n) = A000005(n).

EXAMPLE

a(12) = 46656 because d(12) = 6 and we can write 46656 = 6^6 or 46656 =

CROSSREFS

Cf. A000005, A008973, A008974, A051674.

Sequence in context: A171633 A221276 A117429 * A112953 A110139 A078146

Adjacent sequences:  A132647 A132648 A132649 * A132651 A132652 A132653

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol, Aug 29 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 19:15 EST 2018. Contains 318081 sequences. (Running on oeis4.)