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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114572 Number of "ultrasweet" Boolean functions of n variables which depend on all the variables. 4
2, 1, 2, 6, 27, 185, 2135, 55129 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Inverse binomial transform of A114491.

This sequence enumerates a certain type of matroid, except for the first entry (which is 2 instead of 1). If the first entry is changed from 2 to 1, giving A118085, this enumerates "combinatorial geometries" on n labeled points.

These are matroids in which no element has rank 0; equivalently, all one-element sets are independent; equivalently, the closure of the empty set is empty.

These are called "simple matroids" in A002773. So A118085 is the "labeled" equivalent of that sequence, which counts unlabeled points.

EXAMPLE

For all n>1, a function like "x2" is counted in A114491 but not in the present sequence.

CROSSREFS

Cf. A114302, A114303, A114491, A118085, A002773.

Sequence in context: A032163 A038078 A000139 * A052621 A131057 A051852

Adjacent sequences:  A114569 A114570 A114571 * A114573 A114574 A114575

KEYWORD

nonn

AUTHOR

D. E. Knuth, Aug 17 2008, Oct 14 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.