OFFSET
1,1
COMMENTS
Number of Boolean functions distinct under simultaneous complementation of the inputs and/or permutation of the inputs, complementation of the output. Algorithm includes elements that are conjectural in nature. Documentation of the algorithm is at web link.
REFERENCES
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973.
LINKS
Marko Riedel, Table of n, a(n) for n = 1..16
Marko Riedel et al., Number of boolean functions
CROSSREFS
KEYWORD
nonn
AUTHOR
Marko Riedel, Feb 15 2018
STATUS
approved