This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005395 Leading term of Stirling's approximation to n!, sqrt(2*Pi)*n^(n+(1/2))/e^n, rounded up. 2
 0, 1, 2, 6, 24, 119, 711, 4981, 39903, 359537, 3598696, 39615626, 475687487, 6187239476, 86661001741, 1300430722200, 20814114415224, 353948328666101, 6372804626194310, 121112786592293964, 2422786846761133394, 50888617325509644404, 1119751494628234263303 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..150 Wikipedia, Stirling's Approximation FORMULA a(n) = ceiling(sqrt(2*Pi)*n^(n+(1/2))/e^n). - Wesley Ivan Hurt, Jun 11 2016 MAPLE A005395:=n->ceil(sqrt(2*Pi)*n^(n+(1/2))/exp(1)^n): seq(A005395(n), n=0..30); # Wesley Ivan Hurt, Jun 11 2016 MATHEMATICA Table[Ceiling[Sqrt[2*Pi]*n^(n + (1/2))/E^n], {n, 0, 20}] (* Wesley Ivan Hurt, Jun 11 2016 *) CROSSREFS Cf. (rounded down) A005393. Sequence in context: A202235 A202236 A177523 * A092495 A110808 A284567 Adjacent sequences:  A005392 A005393 A005394 * A005396 A005397 A005398 KEYWORD nonn,easy AUTHOR EXTENSIONS a(12) onwards corrected by Sean A. Irvine, Jun 11 2016 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.

Last modified December 18 12:36 EST 2018. Contains 318229 sequences. (Running on oeis4.)