login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003217 Maximum of minimum total weight for threshold functions of n Boolean variables.
(Formerly M2455)
0
0, 1, 3, 5, 9, 17, 35, 79, 209 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

REFERENCES

N. Alon and V. H. Vu, Anti-Hadamard matrices, coin weighing, threshold gates and indecomposable hypergraphs, Journal of Combinatorial Theory A79 (1997), 133-160.

S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 268.

S. Muroga, T. Tsuboi and C. R. Baugh, "Enumeration of threshold functions of eight variables," IEEE Transactions on Computers, 19 (1970), 818-825.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=0..8.

FORMULA

For asymptotics see the Alon-Vu article.

EXAMPLE

a(4)=9 because the threshold functions "majority of wwxxyz000" and "majority of wwwxxyz00" and "majority of wwwxxyyz0" cannot be described as majority of seven or five things, but no threshold function of w,x,y,z requires a majority of more than nine.

CROSSREFS

Sequence in context: A099170 A251705 A018095 * A297011 A178717 A006723

Adjacent sequences:  A003214 A003215 A003216 * A003218 A003219 A003220

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 20:01 EST 2019. Contains 319309 sequences. (Running on oeis4.)