The Cauchy identity for Sp(2n)

is presented, using the insertion algorithm of Berele. A key element in the bijection is a new encoding of updown tableaux. We present this as a correspondence proving the following enumerative formula for the number of up-down tableaux of length k and shape p: