A003183 Number of NPN-equivalence classes of unate Boolean functions of n or fewer variables.
1, 2, 3, 6, 17, 112, 8282
Offset: 0
Examples
a(2)=3 because m(x,y)=x, n(x,y)=y, k(x,y)=0, h(x,y)=1, f(x,y)=x*y, g(x,y)=x+y+xy are the six monotone Boolean functions of 2 or fewer variables; m and n are equivalent, k and h are equivalent, f and g are equivalent. Then we have 3 inequivalent monotone Boolean functions of 2 or fewer variables.
References
- S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 38, Table 2.3.2. - Row 18.
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- Aniruddha Biswas and Palash Sarkar, Counting unate and balanced monotone Boolean functions, arXiv:2304.14069 [math.CO], 2023.
- Aniruddha Biswas and Palash Sarkar, Counting Unate and Monotone Boolean Functions Under Restrictions of Balancedness and Non-Degeneracy, J. Int. Seq. (2025) Vol. 28, Art. No. 25.3.4. See pp. 2, 8, 17.
- Saburo Muroga, Threshold Logic and Its Applications, Wiley, NY, 1971. [Annotated scans of a few pages]
- Index entries for sequences related to Boolean functions
Extensions
Additional comments from Alan Veliz-Cuba (alanavc(AT)vt.edu), Jun 18 2006
Comments