# Accession Number:

## AD0641081

# Title:

## 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.

# Descriptive Note:

## Technical rept.,

# Corporate Author:

## ILLINOIS UNIV URBANA ELECTRICAL ENGINEERING RESEARCH LAB

# Personal Author(s):

# Report Date:

## 1965-12-01

# Pagination or Media Count:

## 185.0

# Abstract:

A printout is given for a program for computing Stirling numbers of the second kind that uses the recursive formula Sn,k Sn-1, k-1 k. SN-1,k for k2, and Sn,k 1 for k 1. Computed values are given for Sn,k 10exp 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

# Descriptors:

# Subject Categories:

- Statistics and Probability