A112650 Number of truth tables generated by (n-1)-CNF Boolean expressions of n variables.

10, 166, 43146, 2805252934

Offset: 2

Author

Brad Barber (bradb(AT)shore.net), Dec 27 2005

Keywords

• more
• nonn

Comments

Conjunctive Normal Form (CNF) is a conjunction of disjunctions. k-CNF limits each disjunctive clause to k variables and their complements.

Examples

			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.
		

Links

• C. B. Barber, ttcnf 2005.1 (April 2005).
• C. B. Barber, www.qhull.org/ttcnf.

Crossrefs

Cf. A109457, A112535.