login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A331978 A210855 A324228 * A113096 A135078 A195243
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
Better description from Alastair King, Mar 17, 2023.
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 22:00 EDT 2024. Contains 372431 sequences. (Running on oeis4.)