67263

Appears in sequences

• Number of labeled connected bipartite graphs on n nodes.at n=6A001832
• a(n) = the smallest number m such that there are exactly n sets of consecutive primes, each of which has an arithmetic mean of m.at n=11A050237
• Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.at n=21A228859
• Triangle read by rows: T(n,k) is the number of k-colored connected graphs on n labeled nodes up to permutation of the colors.at n=22A322278