The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A132183 Number of "regular" Boolean functions of n variables. 2
 2, 3, 5, 10, 27, 119, 1173, 44315, 16175190, 284432730176 (list; graph; refs; listen; history; text; internal format)
 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.) Michael Somos (Mar 13 2012) asks if A003187 and A132187 are the same. - N. J. A. Sloane, Mar 13 2012 LINKS Stefan Bolus, A QOBDD-based Approach to Simple Games, Dissertation, Doktor der Ingenieurwissenschaften der Technischen Fakultaet der Christian-Albrechts-Universitaet zu Kiel, 2012. - From N. J. A. Sloane, Dec 22 2012 Bjørn Kjos-Hanssen, 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 14 05:51 EDT 2021. Contains 345018 sequences. (Running on oeis4.)