On the number of clique Boolean functions
Grant R. Pogosyan, Masahiro Miyakawa, Akihiro Nozaki · Kyoto University Research Information Repository (Kyoto University) · 1988
An explicit formula for the number of n-variable "clique functions" is given, which contain "bad" parameters related to the numbers of certain monotone functions.We compute the number of n-variable clique functions for up to $n=7$ through the evaluation of the parameters. List of Notationsthe largest integer $\leq a$ , i.e floor of $a