45186

Appears in sequences

• Triangle T(n,k) of the number of unlabeled graphs on n nodes with universal reconstruction number k, 3<=k<=n. URN(G) is the minimum size for which all multisubsets of vertex-deleted subgraphs of G can uniquely reconstruct G up to isomorphism.at n=21A124003
• a(n) = Sum_{k=0..floor(n/3)} |Stirling1(n - 2*k,n - 3*k)|.at n=17A357931