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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A317634 Number of caps (also clutter partitions) of clutters (connected antichains) spanning n vertices. 11
1, 0, 1, 9, 315, 64880 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

A kernel of a clutter is the restriction of the edge set to all edges contained within some connected vertex set. A clutter partition is a set partition of the edge set using kernels.

LINKS

Table of n, a(n) for n=0..5.

Gus Wiseman, Every Clutter Is a Tree of Blobs, The Mathematica Journal, Vol. 19, 2017.

Gus Wiseman, All clutter partitions of non-isomorphic clutters on 4 vertices.

EXAMPLE

The a(3) = 9 clutter partitions:

  {{{1,2,3}}}

  {{{1,3},{2,3}}}

  {{{1,2},{2,3}}}

  {{{1,2},{1,3}}}

  {{{1,3}},{{2,3}}}

  {{{1,2}},{{2,3}}}

  {{{1,2}},{{1,3}}}

  {{{1,2},{1,3},{2,3}}}

  {{{1,2}},{{1,3}},{{2,3}}}

CROSSREFS

Cf. A001187, A030019, A048143, A275307, A286520,, A293510, A304717, A317631, A317632, A317635.

Sequence in context: A217145 A266835 A288324 * A198401 A135609 A277422

Adjacent sequences:  A317631 A317632 A317633 * A317635 A317636 A317637

KEYWORD

nonn,more

AUTHOR

Gus Wiseman, Aug 02 2018

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 December 8 12:07 EST 2019. Contains 329862 sequences. (Running on oeis4.)