login

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”).

A002077
Number of N-equivalence classes of self-dual threshold functions of exactly n variables.
(Formerly M3683 N1503)
18
1, 0, 1, 4, 46, 1322, 112519, 32267168, 34153652752
OFFSET
1,4
REFERENCES
S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 38, Table 2.3.2. - Row 10.
S. Muroga and I. Toda, Lower bound on the number of threshold functions, IEEE Trans. Electron. Computers, 17 (1968), 805-806.
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
S. Muroga, Threshold Logic and Its Applications, Wiley, NY, 1971 [Annotated scans of a few pages]
S. Muroga, T. Tsuboi and C. R. Baugh, Enumeration of threshold functions of eight variables, IEEE Trans. Computers, 19 (1970), 818-825. [Annotated scanned copy]
FORMULA
A002080(n) = Sum_{k=1..n} a(k)*binomial(n,k). Also A000609(n-1) = Sum_{k=1..n} a(k)*binomial(n,k)*2^k. - Alastair D. King, Mar 17, 2023.
CROSSREFS
KEYWORD
nonn,more
EXTENSIONS
Better description from Alastair King, Mar 17, 2023.
STATUS
approved