|
Search: id:A132183
|
|
|
| A132183 |
|
Number of "regular" Boolean functions of n variables. |
|
+0
1
|
|
| 2, 3, 5, 10, 27, 119, 1173, 44315, 16175190, 284432730176
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
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.)
|
|
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: A133662 A088938 A000617 this_sequence A003504 A003182 A134294
Adjacent sequences: A132180 A132181 A132182 this_sequence A132184 A132185 A132186
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
D. E. Knuth, Nov 19 2007
|
|
|
Search completed in 0.002 seconds
|
