- Averaging Sequences, Deranged Mappings, and a Problem of Lampert and Slater
- How to do Monthly problems with your computer Istvan Nemes, Marko Petkovsek, Herbert S. Wilf, and Doron Zeilberger
- generatingfunctionology Herbert S. Wilf
- The Power of a Prime That Divides a Generalized Binomial Coefficient
- The numbertheoretic content of the Jacobi triple product identity
- This page intentionally left blank [50] Develop computer programs for simplifying sums
- The wind, the trees, and the flame Herbert S. Wilf
- The distribution of the binomial coefficients modulo p Richard Garfield and Herbert S. Wilf*
- Review of A = B by Marko Petkovsek, Herbert S. Wilf, and Doron Zeilberger
- On the coefficients in the HardyRamanujanRademacher formula for p(n) Gert Almkvist and Herbert S. Wilf \Lambda
- East Side, West Side . . . an introduction to combinatorial familieswith Maple programming
- Extreme Palindromes Kathy Q. Ji and Herbert S. Wilf
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- Pattern avoidance in compositions and multiset permutations Carla D. Savage
- The Patterns of Permutations Herbert S. Wilf
- In the paper Ted Chinburg, Carla D. Savage, and Herbert S. Wilf, Combinatorial families that are exponentially
- Basis Partitions Jennifer M. Nolan
- A combinatorial determinant Herbert S. Wilf
- JOURNAL OF ALGORITHMS 12, 179-182 (1991) Two Algorithms for the Sieve Method
- JOURNAL OF NUMBER THEORY 25, 308-312 (1987) Periodicities of Partition Functions and
- SIAM J. ALG. DISC. METH. Voi. 7, No. 1, January 1986
- Information Processing Letters 18 (1984) 119-121 North-Holland
- JOURNAL OF COMBINATORIAL THEORY, Series A 34, 80-89 (1983) Sieve Equivalence in Generalized Partition Theory
- JOURNAL OF ALGORITHMS 2,204-207 (1981) The Uniform Selection of Free Trees
- ADVANCES IN MATHEMATICS 31, 104-109 (1979) A Probabilistic Proof of a Formula for the Number of
- JOURNAL OF COMBEVATORL4L THEORY (B> 22, 296 (1977) A Note On P(-A; G)
- MA THEMA TICS ON A CONJECTURE OF RYSElt AND MINC
- Numerische Mathematik 6, 315 --319 (1964) Exactness Conditions in Numerical Quadrature*
- Journal of Approximation Theory 100, 392 401 (1999) BOOK REVIEWS
- Some unsolved problems Herbert Wilf
- About the Electronic Journal of Combinatorics Herbert S. Wilf
- A Note on an Identity of Feigin-Stoyanovsky Herbert S. Wilf
- Science is what we understand well enough to explain to a computer. Art is everything else we do. During the past several years an important part of mathe-
- A lot of toast, with a side order of roast Herbert S. Wilf
- Happy Birthday, Doron!!!!!!!!! Doron Zeilberger is
- New Views of the Idea of Mathematical Induction
- A Note on an Identity of Feigin-Stoyanovsky Herbert S. Wilf
- On the outstanding elements of permutations Herbert S. Wilf
- A note on the "3x + 1' problem-H. Wilf, March 19, 1993 Take a positive integer n and repeat the following operations: if n is odd then replace n
- JOURNAL OF COMBINATORIAL THEORY (A) 22, 107-109 (1977) On the Sequential and Random Selection of Subspaces over a
- On the Multiplicity of Parts in a Random Partition Sylvie Corteel
- generatingfunctionology Herbert S. Wilf
- The variance of the Stirling cycle numbers Herbert S. Wilf
- Left-to-right maxima in words and multiset permutations Amy N. Myers
- ADVANCES IN MATHBMATICS 24, 281-291 (1977) A Unified Setting for Sequencing, Ranking, and Selection
- JOURNAL OF COMBINATORIAL THEORY, Series B 40, 113-117 (1986) Spectral Bounds for the Clique and Independence
- Some summation identities and their computer proofs Jacques Gasqui Hubert Goldschmidt Herbert S. Wilf
- Computing the distribution of the maximum in balls-and-boxes problems with application
- The method of characteristics, and `problem 89' of Graham, Knuth and Patashnik
- RATIONAL FUNCTIONS CERTIFY COMBINATORIAL IDENTITIES Herbert S. Wilf and Doron Zeilberger
- JOURNAL OF COMBINATORLAL THEORY (A) 18, 219-222 (1975) A Method and Two Algorithms on the Theory of Partitions
- The Problem of the Kings Herbert S. Wilf
- The joint distribution of descent and major index over restricted sets of permutations
- Mathematics: An Experimental Science
- Theoretical ELSEVIER Theoretical Computer Science 159 (1996) 5-13
- JOURNAL OF COMBINATORIAL THEORY (A) 18, 80-87 (1975) On Eulerian Circuits and Words with
- JOURNAL OF NUMBER THEORY 4, 98-106 (1972) Representations of Integers by Linear Forms
- The asymptotic behavior of the Stirling numbers of the first kind Herbert S. Wilf*
- A Pentagonal Number Sieve Sylvie Corteel #
- Errata for "A=B", as of March, 2006 Errata and addenda for the third printing
- THE INTERCHANGE GRAPH OF A FINITE GRAPH A. C. M. van ROOIJ and H.S. W1LF* (Philadelphia, USA)
- "A=B" by Marko Petkovsek, Herbert S. Wilf and Doron Zeilberger Reviewed by Ian Wanless, Department of Computer Science, Australian National University, Canberra
- ON CYCLIC STRINGS WITHOUT LONG CONSTANT BLOCKS Alexander Burstein and Herbert S. Wilf*
- New Views of the Idea of Mathematical Induction
- Sums of closed form functions satisfy recurrence relations Herbert S. Wilf 1
- Can there be "research in mathematical education"? Herbert S. Wilf
- The Rectilinear Crossing Number of a Complete Graph and Sylvester's ``Four Point Problem'' of Geometric Probability
- Errata for ``A=B'', as of February, 1998 I. Errata for the first printing
- To Aviezri Fraenkel, on his eightieth birthday; May 2009 Dear Shaula, Aviezri, and friends,
- Recounting the rationals Neil Calkin
- An Identity of J. S. Lomont and John Brillhart August 8, 1999
- We now know ([Z1], [WZ1]) that a large class of special function identities and binomial coefficient identities, are verifiable in a finite number of steps, since they can be embedded in the class of holonomic
- Five surprisingly simple complexities Volker Strehl and Herbert S. Wilf*
- FINDING THE KERNEL OF A MATRIX WITH SYMBOLIC ENTRIES Herbert S. Wilf