343392

Appears in sequences

• Irregular triangular array read by rows T(n,k) is the number of 2-colored labeled graphs that have exactly k edges, n >= 2, 0 <= k <= A033638(n).at n=45A201143
• Number of sets of nonempty words with a total of n letters over n-ary alphabet such that if a letter occurs in the set all predecessors occur at least once.at n=7A319518
• Numbers k such that A380845(k) = 3*k.at n=16A380847