6300672

Appears in sequences

• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph consists of a single node or has a unique cycle of length 3.at n=53A144207
• Number of pairs of antipodal vertices in the level n>1 Sierpiński triangle graph.at n=11A370933