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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165797 a(n) = n^( sigma(n) - tau(n) ). 1
1, 2, 9, 256, 625, 1679616, 117649, 8589934592, 3486784401, 100000000000000, 25937424601, 552061438912436417593344, 23298085122481, 83668255425284801560576, 332525673007965087890625 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The power of n with exponent given by the difference between its sum of divisors and its count of divisors.

LINKS

Jaroslav Krizek, Table of n, a(n) for n = 1..50

FORMULA

a(n) = n^(A000203(n)-A000005(n)) = n^A000203(n) / n^A000005(n) = n^A065608(n).

a(n) = A100879(n) / A062758(n).

a(p) = p^(p-1) for p = prime.

EXAMPLE

a(4) = 4^(sigma(4)-tau(4)) = 4^(7-3) = 4^4 = 256.

MATHEMATICA

Table[n^[ DivisorSigma[1, n] - DivisorSigma[0, n]], {n, 50}]

CROSSREFS

Sequence in context: A112311 A067564 A267408 * A011823 A122894 A042675

Adjacent sequences:  A165794 A165795 A165796 * A165798 A165799 A165800

KEYWORD

nonn

AUTHOR

Jaroslav Krizek, Sep 27 2009

EXTENSIONS

Slightly edited by R. J. Mathar, Sep 29 2009

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 8 08:49 EST 2019. Contains 329862 sequences. (Running on oeis4.)