16186170

Appears in sequences

• Triangular array read by rows: T(n,k) is the number of 2-regular labeled graphs on n nodes that have exactly k connected components (cycles); n>=3, 1<=k<=floor(n/3).at n=29A201013