1

Resolved

Stirling Numbers

description

There are interesting for a number of applications: combinatoric, enumerative, translating between representations of polynomials in simple powers of x and rising/falling powers of x.
 
What makes this problem thorny is that I know of no evaluation method except the recursive one, and that's clearly a problem for large arguments.

comments