Triangle read by rows: T(n,k) is the number of vertices with degree k counted over all hypergraphs on n labeled nodes, n>=1,0<=k<=2^(n-1).

A285624

Triangle read by rows: T(n,k) is the number of vertices with degree k counted over all hypergraphs on n labeled nodes, n>=1,0<=k<=2^(n-1).