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!)
A305000 Number of labeled antichains of finite sets spanning some subset of {1,...,n} with singleton edges allowed. 19
1, 2, 8, 72, 1824, 220608, 498243968, 309072306743552, 14369391925598802012151296 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Only the non-singleton edges are required to form an antichain.

LINKS

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

Gus Wiseman, Sequences enumerating clutters, antichains, hypertrees, and hyperforests, organized by labeling, spanning, and allowance of singletons.

FORMULA

Binomial transform of A304999.

EXAMPLE

The a(2) = 8 antichains:

  {}

  {{1}}

  {{2}}

  {{1,2}}

  {{1},{2}}

  {{1},{1,2}}

  {{2},{1,2}}

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

CROSSREFS

Cf. A006126, A261005, A304996, A304997, A304998, A304999, A305000, A305001.

Cf. A000372, A003182, A014466, A293606, A293993, A306505, A320449, A321679.

Sequence in context: A294351 A125814 A295044 * A013002 A012998 A143760

Adjacent sequences:  A304997 A304998 A304999 * A305001 A305002 A305003

KEYWORD

nonn,more

AUTHOR

Gus Wiseman, May 23 2018

EXTENSIONS

a(5)-a(8) from Gus Wiseman, May 31 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 March 28 17:51 EDT 2020. Contains 333103 sequences. (Running on oeis4.)