Xref: utzoo sci.math:14810 comp.parallel:2154
Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!lll-winken!elroy.jpl.nasa.gov!sdd.hp.com!wuarchive!emory!hubcap!sarnath
From: sarnath@sybil.cs.buffalo.edu (Ramnath Sarnath)
Newsgroups: sci.math,comp.parallel
Subject: Stirling numbers of the second kind
Message-ID: <12786@hubcap.clemson.edu>
Date: 25 Jan 91 17:28:01 GMT
Sender: fpst@hubcap.clemson.edu
Followup-To: sci.math
Organization: State University of New York at Buffalo/Comp Sci
Lines: 17
Approved: parallel@hubcap.clemson.edu

I am looking for good approximations for stirling numbers of the second
kind. 

i.e, stirling number {n,k} = number of ways to partition n elements into
k non-empty subsets.

These approximations should get better as n gets bigger. Asymptotic
approximations are also welcome. 

I have some literature on this, but looks like I need to do a lot of
spadework before I can use it. I'd appreciate any reference
where I could directly  obtain a closed formula


thanx,

sarnath