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,4

Links

Table of n, a(n) for n=0..8.

Example

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.

Sequence in context: A012914 A168404 A013087 * A013136 A013004 A012679

Adjacent sequences: A121268 A121269 A121270 * A121272 A121273 A121274

Keyword

hard,more,nonn

Author

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

Status

approved