  We employ computer algebra algorithms to prove a collection of identities
involving Bessel functions with half-integer orders and other special
functions. These identities appear in the famous Handbook of Mathematical
Functions, as well as in its successor, the DLMF, but their proofs were lost.
We use generating functions and symbolic summation techniques to produce new
proofs for them.
