A121271 Number of different vertex-degree sequences of simple 3-uniform hypergraphs on n vertices.

1, 1, 1, 2, 16, 533, 42175, 5554128, 1030941214

Offset: 0

Author

Caroline Klivans and Victor Reiner (reiner(AT)math.umn.edu), Aug 23 2006

Keywords

• hard
• more
• nonn

Examples

			a(3)=2 counts these two degree sequences: (0,0,0) and (1,1,1), the former corresponding to the empty 3-uniform hypergraph with no hyperedges and the latter for the 3-uniform hypergraph having the unique hyperedge {1,2,3}.
		

Crossrefs

Cf. A005155.