Content-Length: 26527 | pFad | https://dlmf.nist.gov/./../././././bib/../././././././.././26.21

DLMF: §26.21 Tables ‣ Computation ‣ Chapter 26 Combinatorial Analysis
About the Project
26 Combinatorial AnalysisComputation

§26.21 Tables

Abramowitz and Stegun (1964, Chapter 24) tabulates binomial coefficients (mn) 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, s(n,k) and S(n,k), for n up to 25 and k up to n; tabulates partitions p(n) and partitions into distinct parts p(𝒟,n) for n up to 500.

Andrews (1976) contains tables of the number of unrestricted partitions, partitions into odd parts, partitions into parts ±2(mod5), partitions into parts ±1(mod5), and unrestricted plane partitions up to 100. It also contains a table of Gaussian polynomials up to [126]q.

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









ApplySandwichStrip

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier!      Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

Fetched URL: https://dlmf.nist.gov/./../././././bib/../././././././.././26.21

Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy