Abstract
The binomial convolution of two sequences {an} and {bn} is the sequence whose nth term is ∑nk=0(nk)akbn−k. If {an} and {bn} have rational generating functions then so does their binomial convolution. We discuss an efficient method, using resultants, for computing this rational generating function and give several examples involving Fibonacci and tribonacci numbers and related sequences. We then describe a similar method for computing Hadamard products of rational generating functions. Finally we describe two additional methods for computing binomial convolutions and Hadamard products of rational power series, one using symmetric functions and one using partial fractions.