151455

Appears in sequences

• Number of graphs on n labeled nodes with maximal degree exactly 2.at n=7A136284
• a(n) = (1/4)*A291038(n).at n=13A291039
• Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and minimum vertex-degree k.at n=41A327366