Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132650
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132650 Number of divisors of n, d(n) raised to power d(n). +0
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; listen)
OFFSET

1,2

FORMULA

a(n) = d(n)^d(n).

EXAMPLE

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

CROSSREFS

Cf. A000005, A008973, A008974, A051674.

Sequence in context: A058166 A092897 A117429 this_sequence A112953 A110139 A078146

Adjacent sequences: A132647 A132648 A132649 this_sequence A132651 A132652 A132653

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Aug 29 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research