47079

Appears in sequences

• Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2*n/3).at n=57A046752
• Number of zero-sum nX1 -1..1 arrays with every element equal to at least one horizontal or vertical neighbor.at n=19A201840
• Number of partitions of n with parts colored by {0, 1} such that the sum of colors is congruent to 1 (mod 2).at n=24A392002