|
%I #2 Feb 27 2009 03:00:00
%S 1,1,1,2,16,533,42175,5554128,1030941214
%N Number of different vertex-degree sequences of simple 3-uniform hypergraphs on n vertices.
%e 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}.
%Y Cf. A005155.
%K hard,more,nonn
%O 0,4
%A Caroline Klivans and Victor Reiner (reiner(AT)math.umn.edu), Aug 23 2006
|
