A303584 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A303584

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

0

2, 3, 6, 22, 253, 37098, 109873815

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

REFERENCES

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

LINKS

Table of n, a(n) for n=0..6.

CROSSREFS

Sequence in context: A015759 A260562 A173249 * A261014 A000616 A233217

Adjacent sequences: A303581 A303582 A303583 * A303585 A303586 A303587

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, May 13 2018

STATUS

approved