Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003217
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003217 Maximum of minimum total weight for threshold functions of n Boolean variables.
(Formerly M2455)
+0
1
0, 1, 3, 5, 9, 17, 35, 79, 209 (list; graph; listen)
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).

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: A087312 A099170 A018095 this_sequence A006723 A096390 A092264

Adjacent sequences: A003214 A003215 A003216 this_sequence A003218 A003219 A003220

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research