11366961

Appears in sequences

• Number of simple connected graphs on n unlabeled nodes with radius 2.at n=9A324061
• Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).at n=31A324239