login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121271 Number of different vertex-degree sequences of simple 3-uniform hypergraphs on n vertices. 0
1, 1, 1, 2, 16, 533, 42175, 5554128, 1030941214 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 24 17:00 EST 2020. Contains 332209 sequences. (Running on oeis4.)