|
|
A000609
|
|
Number of threshold functions of n or fewer variables.
(Formerly M1285 N0492)
|
|
11
|
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(n) is also equal to the number of self-dual threshold functions of n+1 or fewer variables. - Alastair D. King, Mar 17, 2023.
|
|
REFERENCES
|
Sze-Tsen Hu, Threshold Logic, University of California Press, 1965 see page 57.
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.1, p. 79.
S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 38, Table 2.3.2. - Row 3.
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).
C. Stenson, Weighted voting, threshold functions, and zonotopes, in The Mathematics of Decisions, Elections, and Games, Volume 625 of Contemporary Mathematics Editors Karl-Dieter Crisman, Michael A. Jones, American Mathematical Society, 2014, ISBN 0821898663, 9780821898666
|
|
LINKS
|
Muroga, Saburo, Iwao Toda, and Satoru Takasu, Theory of majority decision elements, Journal of the Franklin Institute 271.5 (1961): 376-418. [Annotated scans of pages 413 and 414 only]
Stephen Wolfram, A New Kind Of Science. page 1102.
|
|
FORMULA
|
a(n) = Sum_{k=0..n} A000615(k)*binomial(n,k) = Sum_{k=0..n} A002079(k)*binomial(n,k)*2^k. Also A002078(n) = (1/2^n)*Sum_{k=0..n} a(k)*binomial(n,k), a(n-1) = Sum_{k=1..n} A002077(k)*binomial(n,k)*2^k, and A002080(n) = (1/2^n)*Sum_{k=1..n} a(k)*binomial(n,k). - Alastair D. King, Mar 17, 2023.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,core,nice,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|