|
%I #5 Jan 04 2021 19:59:34
%S 10,166,43146,2805252934
%N Number of truth tables generated by (n-1)-CNF Boolean expressions of n variables.
%C Conjunctive Normal Form (CNF) is a conjunction of disjunctions. k-CNF limits each disjunctive clause to k variables and their complements.
%H C. B. Barber, <a href="http://www.qhull.org/download/ttcnf-2005.1.zip">ttcnf 2005.1</a> (April 2005).
%H C. B. Barber, <a href="http://www.qhull.org/ttcnf">www.qhull.org/ttcnf</a>.
%e The 1-CNF expressions of 2 variables are a, -a, b, -b, a and b, a and -b, -a and b, -a and -b, a and -a, true. Their truth tables are 0xC, 0x3, 0xA, 0x5, 0x8, 0x4, 0x2, 0x1, 0x0, 0xF.
%Y Cf. A109457, A112535.
%K more,nonn
%O 2,1
%A Brad Barber (bradb(AT)shore.net), Dec 27 2005
|
