Schröder–Hipparchus number

The Schröder–Hipparchus number, denoted \( \text{SH}(n) \), is a sequence of numbers that counts the different ways to draw non-crossing partitions of a set with \( n \) elements. Specifically, these numbers are related to various combinatorial structures, including certain types of trees and the enumeration of non-crossing partitions.