From: kfl@KeithLynch.net   
      
   Keith F. Lynch  wrote:   
   > Joy Beeson  wrote:   
   >> I'll bet that those numbers also have a name.  The series   
   >> 1^1, 2^2, . . . has a rising rate that puts factorials to   
   >> shame.   
      
   > Apparently not, other than n^n, but you can read all about it at   
   > https://oeis.org/A000312   
      
   To clarify, I was saying it apparently doesn't have a name.  I was not   
   disagreeing with your correct claim that it grows much faster than   
   factorials.   
      
   Stirling's approximation is a formula for large factorials.  It   
   consists of raising n/e to the nth power, then multiplying by the   
   square root of 2 pi n.  It's not exact, but it's pretty close for   
   large numbers, and much easier to calculate than multiplying large   
   quantities of consecutive numbers.   
   --   
   Keith F. Lynch - http://keithlynch.net/   
   Please see http://keithlynch.net/email.html before emailing me.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)