134526

Appears in sequences

• Number of connected graphs on n labeled nodes, each node being colored with one of 2 colors, such that no edge joins nodes of the same color.at n=7A002027
• Number of labeled connected digraphs on n nodes where every node has indegree 0 or outdegree 0 and no isolated nodes.at n=5A002031
• Number of nondecreasing -3..3 vectors of length n whose dot product with some nondecreasing -3..3 vector equals n.at n=17A226406
• Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.at n=21A228892
• List of André permutations of the first kind.at n=33A278982
• Array read by antidiagonals: T(n,k) is the number of connected graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.at n=52A322279
• T(n,k) is the number of connected labeled posets with n elements and rank k: triangle read by rows.at n=22A342501
• Number of ways to place eight distinct positive integers on a square, four on the corners and four on the sides such that the sum of the three values on each side is n.at n=46A380962