Triangle read by rows: T(n,m) = number of 3-uniform hypergraphs with m hyperedges on n unlabeled nodes, where 0 <= m <= C(n,3).

A092337

Triangle read by rows: T(n,m) = number of 3-uniform hypergraphs with m hyperedges on n unlabeled nodes, where 0 <= m <= C(n,3).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =2a(10) =4a(11) =6a(12) =6a(13) =6a(14) =4a(15) =2a(16) =1a(17) =1a(18) =1a(19) =1a(20) =3a(21) =7a(22) =21a(23) =43a(24) =94a(25) =161a(26) =249a(27) =312a(28) =352a(29) =312

External references