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

%I #8 May 13 2018 10:17:28

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

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

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

%Y See A109457 for definitions and references.

%K nonn,hard,more

%O 0,1

%A _Don Knuth_, Aug 24 2005