56294206205
domain: N
Appears in sequences
- Number of 2-colored connected labeled graphs with n vertices of the first color and n vertices of the second color.at n=5A005333
- Number of connected relations.at n=5A093733
- Triangle read by rows: T(n,k) = number of specially labeled bicolored connected graphs with k points in one color class and n-k points in the other class . "Special" means there are separate labels 1,2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = floor((n+1)/2), ..., n).at n=41A123260
- Leading diagonal of A123260.at n=11A123281
- Triangle read by rows: T(n, m) for 0 <= m <= n is the number of bipartite connected labeled graphs with parts of size n and m.at n=27A227322