General combinatorics of RNA hairpins and cloverleaves

For an abstract single-strand RNA, a combinatorial analysis is given for two important structures, hairpins and cloverleaves. The total number of hairpins and cloverleaves of a given length with minimal hairpin loop length m(m > 0) and with minimal stack length l(l > 0) is computed, under the assumption that all base pairs can occur.