Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there any general formula to sum following series:

$$S = 1^1 + 2^2 + 3^3 + \dotsb+(n - 1)^{n - 1} + n^n, n \in N$$

I mean for $S = f(n)$, is there a formula to compute $f(n)$?

share|cite|improve this question
It seems to me a possible duplicate, but I don't remember exactly. – vesszabo Jan 14 '13 at 19:01
Nope, sorry. This is equivalent to the integral of $x^x$. Faulhaber's formula is about polynomials. – GregRos Jan 15 '13 at 5:43
In general, if there isn't an elementary integral for a function there will not be a partial sum formula either. – GregRos Jan 15 '13 at 5:45
I found the first few values (for $n = 1, \dots , 4$), and this sequence (not surprisingly) appears in OEIS. You can find more information there. – JavaMan Jan 15 '13 at 5:52

From simple graphing, I've managed to find really good bounds for your function:


I have no guarantee that my inequalities will hold true, but they most certainly hold true from graphing for $20\le n\le143$, which is decently large.

If your wondering how I derived this, I took a guess at how fast $f(n)$ grew and attempted to derive a formula with equivalent growth, seeing that $n^n<f(n)<(n+1)^{n+1}$, we can see how fast it grows, and I just took the log of it to keep numbers manageable.

From a nice article, I took the most understandable parts of it to see that for $n>2$,

$$n^n\left(\frac{4n-3}{4n-4}\right)\le f(n)\le n^n\left(\frac{2+e(n-1)}{e(n-1)}\right)$$

At proposition 2.1.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.