301541

Appears in sequences

• Number of n-node unlabeled connected graphs with one cycle of length 3.at n=14A000226
• Let [n] = {1,2,...,n}. Let G_n be the union of all closed line segments joining any two elements of [n] X [n] along a vertical or horizontal line, or along a line with slope +-1. Then a(n) = combined total of the number of (nondegenerate) triangles and rectangles for which all edges are subsets of G_n.at n=23A098921