A109459 Number of inequivalent Krom functions on n variables (or 2SAT instances) under permuting and complementing variables.

2, 3, 6, 14, 45, 196, 1360, 15631

Offset: 0

Author

Don Knuth, Aug 24 2005

Keywords

• nonn
• hard
• more

References

• Knuth, Donald E., Satisfiability, Fascicle 6, volume 4 of The Art of Computer Programming. Addison-Wesley, 2015, pages 148 and 220, Problem 191.

Crossrefs

See A109457 for definitions and references.