4637 Allan Adler: Magic cubes and the 3-adic zeta function.
Math. Intell. 14/3 (1992), 14-23.

22888 Martin Aigner: A course in enumeration. Springer 2007, 560p. Eur 33.

27524 George Andrews: q-series. AMS 1986, 130p. Eur 31.

6458 George Andrews: The death of a proof? Semi-rigorous mathematics? 
You've got to be kidding! Math. Intell. 16/4 (1994), 16-18.

3053 E. Bender/J. Goldman: Enumerative uses of generating functions.
Indiana Univ. Math. J. 20 (1971), 753-765. [3570]

24125 Francesco Brenti/Volkmar Welker: The Veronese construction for formal
power series and graded algebras. Adv. Appl. Math. 42 (2009), 545-556.

5694 E. Canfield: Review of Wilf's book "Generatingfunctionology".
Math. Intell. 15/2 (1993), 71-75.

22857 Charalambos Charalambides: Enumerative combinatorics.
Chapman & Hall 2002, 610p. Eur 75.

10723 Maylis Delest: Algebraic languages - a bridge between combinatorics
and computer science. Internet ca. 1996, 17p.

24145 Peter Doubilet/Gian-Carlo Rota/Richard Stanley: On the foundations
of combinatorial theory VI - The idea of generating function.
Proc. 6th Berkeley Symp. Math. Stat. Prob. 2 (1970), 267-318.

G. Egorychev: Integral representation and the computation of combinatorial
sums. AMS 1984.

Philippe Flajolet/Daniele Gardy/Loys Thimonier: Birthday paradox, coupon
collectors, caching algorithms and self-organizing search.
Discrete Applied Math. 39 (1992), 207-229.

Philippe Flajolet/Donald Knuth/Boris Pittel: The first cycles in an 
evolving graph. Discrete Math. 75 (1989), 167-215.

Philippe Flajolet/Andrew Odlyzko: Singularity analysis of generating
functions. SIAM J. Discrete Math. 3 (1990), 216-240.

P. Flajolet/B. Salvy/P. Zimmermann: Automatic analysis of algorithms.
J. Theor. Computer Sci. 79 (1991), 37-109.

Ira Gessel/Dennis Stanton: Short proofs of Saalschuetz's and Dixon's
theorems. J. Comb. Theory A 38 (1985), 87-90.

I. Goulden/D. Jackson: Combinatorial enumeration. Wiley 1983.

7037 Robert Grossman/Richard Larson: Hopf-algebraic structures of 
combinatorial objects and differential operators.
Israel J. Math. 72 (1990), 109-117.

3423 W. Hayman: Review of the book "Generatingfunctionology" by Herbert Wilf. 
Bull. AMS 25 (1991), 104-106. [3570]

Peter Henrici: Applied and computational complex analysis I.
Wiley 1974.

3016 A. Joyal: Une theorie combinatoire des series formelles.
Adv. Math. 42 (1981), 1-82. [3570]

3025 Dan Kalman/Abraham Ungar: Combinatorial and functional identities in 
one-parametermatrices. Am. Math. Monthly 94 (1987), 21-35. [3570]

7829 Donald Knuth: Bracket notation for the 'coefficient of' operator.
Internet 1993, 13p.

23968 Peter Kuchment/Sergey Lvin: Identities for sin x that came from
medical imaging. Am. Math. Monthly August-September 2013, 609-621.
Some interesting differential-algebraic identities for trigonometric
end exponential functions.

S. Lando: Lectures on generating functions. AMS 2003, 150p. $29.

3007 O. Nava/Giancarlo Rota: Plethysm, categories, and combinatorics.
Adv. Math. 58 (1985), 61-88. [3570]

I. Niven: Formal power series. Am. Math. Monthly 76 (1969), 871-889.

Peter Paule: Ein neuer Weg zur q-Lagrange-Inversion.
Bayreuther Math. Schriften 18 (1985), 1-37.

25895 Robin Pemantle/Mark Wilson: Analytic combinatorics in several variables.
Internet (draft) ca. 2012, 420p.

17865 Marko Petkovsek/Herbert Wilf/Doron Zeilberger: A = B. Peters 1996, 210p. Eur 40.

3009 D. Reiner: The combinatorics of polynomial sequences.
Studies appl. Math. 58 (1978), 95-117. [3570]

3057 J. Riordan: Inverse relations and combinatorial identities.
Am. Math. Monthly 71 (1964), 485-498. [3570]

Steven Roman: The umbral calculus. Academic Press 1984.

3058 Giancarlo Rota: The number of partitions of a set.
Am. Math. Monthly 71 (1964), 498-503. [3570]

3024 Ranjan Roy: Binomial identities and hypergeometric series.
Am. Math. Monthly 94 (1987), 36-47. [3570]

V. Sachkov: Probabilistic methods in combinatorial analysis.
Cambridge UP 1997, 250p. 0-521-45512-X. Pds. 40.
"Das Ziel des Buches ist, mit Hilfe probabilistischer Methoden Aussagen
u''ber das typische Verhalten kombinatorischer Objekte zu erzielen ...
Dieses Buch kann jedem an der analytischen Kombinatorik Interessierten
nur wa''rmstens empfohlen werden." (M. Drmota)

1700 Richard Stanley: Enumerative combinatorics I. Wadsworth 1986.

24634 Richard Stanley: Enumerative combinatorics. 2nd edition,
preliminary draft. Internet 2011, 720p.

22798 Richard Stanley: Enumerative combinatorics II. Cambridge UP 2010, 580p. Eur 38.

17879 Volker Strehl: Binomial identities - combinatorial and algorithmic aspects.
Internet 1994, 30p.

2964 K. Ueno: Umbral calculus and special functions.
Adv. Math. 67 (1988), 174-229. [3570]

3109 L. Verde-Star: Divided differences and combinatorial identities.
Studies appl. Math. 85 (1991), 389-409. [3570]

Morgan Ward: A calculus of sequences. Am. J. Math. 58 (1936), 255-266.

Herbert Wilf: The snake oil method for proving combinatorial identities.
In Siemons (ed.): Survey in combinatorics. Cambridge UP 1990, 208-217.

2936 Herbert Wilf: The snake oil method for proving combinatirial identities. 
2935 Siemons, 208-217. [3570]

4157 Herbert Wilf: Generatingfunctionology. Academic Press 1990.

17878 Herbert Wilf/Doron Zeilberger: Rational functions certify combinatorial identities.
J. AMS 3/1 (1990), 147-158.

Herbert Wilf/Doron Zeilberger: Towards computerized proofs of identities.
Bull. AMS 23 (1990), 77-83.

J.S. Yang: Symmetric functions, plethysm, and enumeration.
PhD-Thesis, MIT 1991.