|
|
A132183
|
|
Number of "regular" Boolean functions of n variables.
|
|
4
|
|
|
|
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.1-109 of that book. (The material of Section 7.1.1 will be available in paperback in a couple months.)
For n from 1 to 8, a(n) agrees with the number of directed games on n players in Table 1 of Krohn and Sudhölter. - Peter Bala, Dec 16 2021
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|