59179008domain: NAppears in sequencesTriangle T(n,m) for the number of ways to put n stones into an m X n square grid such that each of the m rows contains at least one stone.at n=33A259051Number of non-crossing n-vertex graphs with loops.at n=8A326290