51303

Appears in sequences

• Number of labeled series-parallel graphs with n edges.at n=5A048172
• Duplicate of A048172.at n=5A053554
• Triangle read by rows: T(n,k) is the number of oriented series-parallel networks with n colored elements using exactly k colors.at n=20A339228
• Array read by antidiagonals: T(n,k) is the number of nonequivalent essentially parallel series-parallel networks with longest path of at most n edges and largest cut set of at most k edges.at n=41A391485