Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A112650
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A112650 Number of truth tables generated by (n-1)-CNF boolean expressions of n variables. +0
2
10, 166, 43146, 2805252934 (list; graph; listen)
OFFSET

2,1

COMMENT

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: A074703 A064747 A054688 this_sequence A006295 A006297 A099711

Adjacent sequences: A112647 A112648 A112649 this_sequence A112651 A112652 A112653

KEYWORD

more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research