

A132183


Number of "regular" Boolean functions of n variables.


2




OFFSET

0,1


COMMENTS

The sequence also counts order ideals (or antichains) of the binary majorization lattice with 2^n points. That lattice for n=5 will be illustrated in Fig. 8 of Volume 4 of The Art of Computer Programming. The basic properties of this lattice will be discussed in exercise 7.1.1109 of that book. (The material of Section 7.1.1 will be available in paperback in a couple months.)
Michael Somos (Mar 13 2012) asks if A003187 and A132187 are the same.  N. J. A. Sloane, Mar 13 2012


LINKS

Table of n, a(n) for n=0..9.
Stefan Bolus, A QOBDDbased Approach to Simple Games, Dissertation, Doktor der Ingenieurwissenschaften der Technischen Fakultaet der ChristianAlbrechtsUniversitaet zu Kiel, 2012.  From N. J. A. Sloane, Dec 22 2012
Bjørn KjosHanssen, Lei Liu, The number of languages with maximum state complexity, arXiv:1902.00815 [cs.FL], 2019.


EXAMPLE

For example, the 10 Boolean functions for n=3 have the truth tables
00000000
00000001
00000011
00000111
00001111
00010111
00011111
00111111
01111111
11111111
(things don't get very interesting until n=4 or 5).


CROSSREFS

Sequence in context: A223545 A088938 A000617 * A259878 A003504 A213169
Adjacent sequences: A132180 A132181 A132182 * A132184 A132185 A132186


KEYWORD

nonn,more


AUTHOR

Don Knuth, Nov 19 2007


STATUS

approved



