A000157 Number of Boolean functions of n variables.

1, 2, 7, 111, 308063, 100126976263592, 131867858014413288241233435594064, 2804519150441879896741320496043335469582478995067528608051651559815168

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn

References

• M. A. Harrison, Introduction to Switching and Automata Theory. McGraw Hill, NY, 1965, p. 153 (divided by 2).
• M. A. Harrison, The number of equivalence classes of Boolean functions under groups containing negation, IEEE Trans. Electron. Comput. 12 (1963), 559-561.
• 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

• Sean A. Irvine, Table of n, a(n) for n = 1..11 (shortened by _N. J. A. Sloane_, Jan 13 2019)
• Index entries for sequences related to Boolean functions

Crossrefs

Cf. A000370.

Formula

a(n) = A000370(n)/2. - Sean A. Irvine, Feb 14 2012

Extensions

More terms from Sean A. Irvine, Feb 13 2012