TABLE OF THE STIRLING NUMBERS OF THE SECOND KIND S(N,K) FOR N,K UP TO 100 AND FOR VALUES OF S(N,K) EQUAL OR SMALLER THAN 10(EXP 109)-1.
Abstract
A printout is given for a program for computing Stirling numbers of the second kind that uses the recursive formula S(n,k) = S(n-1, k-1) + k. S(N-1,k) for k>2, and S(n,k) = 1 for k = 1. Computed values are given for S(n,k) < 10(exp 109) - 1, 1< k < n <100. In an introduction, the use of Stirling numbers in various combinatorial problems is discussed, together with an explanation of the use of the table of computed values. Application of the table is described to obtain the following sums for multi-valued logical systems: (a) the number of functions represented by a particular morphogram, and (b) the number of morphograms that may be constructed that admit k different values in an m-valued system; a 'morphogram' is defined as a particular distribution of possible value occupancies alpha, beta, gamma.....(Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1965
- Accession Number
- AD0641081
Entities
People
- Alex M. Andrew
Organizations
- University of Illinois Urbana–Champaign