161845163

Appears in sequences

• Irregular triangle read by rows: T(n,k) (n>=2, k>=1) is the number of strong digraphs on n nodes with k descents.at n=27A339807