Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.

A135021

Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =3a(8) =1a(9) =1a(10) =1a(11) =16a(12) =6a(13) =1a(14) =1a(15) =1a(16) =125a(17) =70a(18) =10a(19) =1a(20) =1a(21) =1a(22) =1296a(23) =1215a(24) =200a(25) =15a(26) =1a(27) =1a(28) =1a(29) =16807

External references