|
Search: id:A121271
|
|
|
| A121271 |
|
Number of different vertex-degree sequences of simple 3-uniform hypergraphs on n vertices. |
|
+0
1
|
| |
|
|
OFFSET
|
0,4
|
|
|
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: A012919 A012914 A013087 this_sequence A013136 A013004 A012679
Adjacent sequences: A121268 A121269 A121270 this_sequence A121272 A121273 A121274
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Caroline Klivans and Victor Reiner (reiner(AT)math.umn.edu), Aug 23 2006
|
|
|
Search completed in 0.002 seconds
|
