login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A320606 Regular triangle read by rows where T(n,k) is the number of k-uniform hypergraphs spanning n labeled vertices where every two vertices appear together in some edge, n >= 0, 0 <= k <= n. 1
1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 5, 1, 0, 0, 1, 388, 16, 1, 0, 0, 1, 477965, 27626, 42, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,14

LINKS

Table of n, a(n) for n=1..28.

EXAMPLE

Triangle begins:

      1

      0      1

      0      0      1

      0      0      1      1

      0      0      1      5      1

      0      0      1    388     16      1

      0      0      1 477965  27626     42      1

MATHEMATICA

Table[Length[Select[Subsets[If[k==0, {}, Subsets[Range[n], {k}]]], And[Union@@#==Range[n], Length[Union@@(Subsets[#, {2}]&/@#)]==Binomial[n, 2]]&]], {n, 0, 6}, {k, 0, n}]

CROSSREFS

Row sums are A321134. Column k = 3 is A302394 without the initial terms.

Cf. A058891, A116539, A301922, A306021, A319189, A320444.

Sequence in context: A098173 A180977 A269129 * A058177 A204619 A228077

Adjacent sequences:  A320603 A320604 A320605 * A320607 A320608 A320609

KEYWORD

nonn,tabl,more

AUTHOR

Gus Wiseman, Jan 10 2019

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 June 26 10:12 EDT 2019. Contains 324375 sequences. (Running on oeis4.)