

A000370


Number of NPNequivalence classes of Boolean functions of n or fewer variables.
(Formerly M1287 N0494)


9




OFFSET

0,2


COMMENTS

Number of Boolean functions distinct under complementation/permutation.


REFERENCES

M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 153.
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.1, p. 79.
S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 38, Table 2.3.2.  Row 16.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS



FORMULA

a(n) is asymptotic to 2^{2^n} / ( n! * 2^{n+1} ) as n > oo. This follows from a theorem of Michael Harrison. See Theorem 3 in Harrison (JACM, 1966).  Eric Bach, Aug 07 2017


CROSSREFS



KEYWORD

nonn,easy,nice


AUTHOR



EXTENSIONS



STATUS

approved



