33374
domain: N
Appears in sequences
- Number of 3-balanced strings of length n: let d(S)= #(1)'s in S - #(0)'s, then S is k-balanced if every substring T has -k<=d(T)<=k; here k=3.at n=19A027557
- G.f. A(x) satisfies A(x) = 1 + x*A(x)^4*A(-x)^2.at n=8A143550
- Number of integer partitions of n that can be partitioned into distinct pairs of distinct parts, i.e., into a set of edges.at n=49A339560