This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112650 Number of truth tables generated by (n-1)-CNF boolean expressions of n variables. 1
 10, 166, 43146, 2805252934 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Conjunctive Normal Form (CNF) is a conjunction of disjunctions. k-CNF limits each disjunctive clause to k variables and their complements. LINKS C. B. Barber, ttcnf 2005.1 (April 2005). C. B. Barber, www.qhull.org/ttcnf. EXAMPLE E.g. 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. CROSSREFS Cf. A109457, A112535. Sequence in context: A064747 A054688 A229228 * A006295 A006297 A099711 Adjacent sequences:  A112647 A112648 A112649 * A112651 A112652 A112653 KEYWORD more,nonn AUTHOR Brad Barber (bradb(AT)shore.net), Dec 27 2005 STATUS approved

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

Content is available under The OEIS End-User License Agreement .