I'm interested in the sum of what I'll call inverse self powers over integers, namely


Almost by accident I found that


which is a pretty neat identity, and fairly easy to prove at that. But of course it does not help much given that the integral is no easier to compute than the sum.

Numerically one finds that


Is there any way to link this number to anything else from number theory, special functions, etc.?

  • 9
    $\begingroup$ See en.wikipedia.org/wiki/Sophomore's_dream $\endgroup$ – quid Jan 22 '16 at 21:08
  • $\begingroup$ You mention ease of computation. Note that $n^n$ grows "pretty fast", so you would only really have to compute the first few terms to get an answer accurate up to some desired tolerance. I already get 1.29129 at the 7th partial sum. $\endgroup$ – parsiad Jan 22 '16 at 21:23
  • $\begingroup$ You're right. I didn't mean numerical computation though. $\endgroup$ – Vinsanity Jan 22 '16 at 21:23
  • $\begingroup$ See fr.scribd.com/doc/34977341/Sophomore-s-Dream-Function $\endgroup$ – JJacquelin Jan 22 '16 at 21:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.