Number of nonisomorphic graded posets with 0 and uniform hasse graph of rank n, with exactly 2 elements of each rank level above 0.(Uniform used in the sense of Retakh, Serconek and Wilson. Graded poset is being used in Stanley's sense that every maximal chain has the same length n.) - David Nacin, Feb 26 2012