2516883516

Appears in sequences

• Triangle read by rows: T(n,k) is the number of labeled 2-connected planar graphs with n nodes and k edges, n >= 3, n <= k <= 3(n-2).at n=43A100960
• a(n) is the maximal value in row n of triangle A100960.at n=6A291837