Digital Library of Mathematical Functions
About the Project
NIST
26 Combinatorial AnalysisComputation

§26.21 Tables

Abramowitz and Stegun (1964, Chapter 24) tabulates binomial coefficients \binom{m}{n} for m up to 50 and n up to 25; extends Table 26.4.1 to n=10; tabulates Stirling numbers of the first and second kinds, \mathop{s\/}\nolimits\!\left(n,k\right) and \mathop{S\/}\nolimits\!\left(n,k\right), for n up to 25 and k up to n; tabulates partitions \mathop{p\/}\nolimits\!\left(n\right) and partitions into distinct parts \mathop{p\/}\nolimits\!\left(\mathcal{D},n\right) for n up to 500.

Andrews (1976) contains tables of the number of unrestricted partitions, partitions into odd parts, partitions into parts \not\equiv\pm 2\;\;(\mathop{{\rm mod}}5), partitions into parts \not\equiv\pm 1\;\;(\mathop{{\rm mod}}5), and unrestricted plane partitions up to 100. It also contains a table of Gaussian polynomials up to \genfrac{[}{]}{0.0pt}{}{12}{6}_{{q}}.

Goldberg et al. (1976) contains tables of binomial coefficients to n=100 and Stirling numbers to n=40.