# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a121271 Showing 1-1 of 1 %I A121271 #2 Feb 27 2009 03:00:00 %S A121271 1,1,1,2,16,533,42175,5554128,1030941214 %N A121271 Number of different vertex-degree sequences of simple 3-uniform hypergraphs on n vertices. %e A121271 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 A121271 Cf. A005155. %K A121271 hard,more,nonn %O A121271 0,4 %A A121271 Caroline Klivans and Victor Reiner (reiner(AT)math.umn.edu), Aug 23 2006 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE