Riordan, John An introduction to combinatorial analysis. (English) Zbl 0436.05001 Princeton, New Jersey: Princeton University Press. XII, 244 p. hbk: $ 23.00; £10.10; pbk: $ 9.25; £3.90 (1980). Reviewer: Heinz Kröger (Berlin) Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 60 Documents MSC: 05-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics 05Axx Enumerative combinatorics 05A05 Permutations, words, matrices 05A15 Exact enumeration problems, generating functions 05A17 Combinatorial aspects of partitions of integers 05C05 Trees 05C99 Graph theory Keywords:permutations; combinations; generating functions; inclusion and exclusion; cycles of permutations; occupancy; partitions; compositions; trees; networks; permutations with restricted position Citations:Zbl 0078.00805 PDF BibTeX XML OpenURL Online Encyclopedia of Integer Sequences: Triangle read by rows of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n. Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n. Triangle of number of labeled trees by number of nodes and number of labels. Triangle of number of node labeled trees by number of nodes and number of labels. Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n. Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n.