cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A198085 Number of nonempty connected, containment-free subsets of 2^[n]. Total number of clutters on all subsets of [n]. Number of connected antichains in the Boolean algebra B_n (the poset of subsets of [n] ordered by containment).

Table of values

n a(n)
1 1
2 3
3 11
4 114
5 6833
6 7783197
7 2414627236077
8 56130437209370100252470

List of values

[1, 3, 11, 114, 6833, 7783197, 2414627236077, 56130437209370100252470]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.