cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A001532 Number of NP-equivalence classes of self-dual threshold functions of n or fewer variables ; number of majority (i.e., decisive and weighted) games with n players.

Original entry on oeis.org

1, 1, 2, 3, 7, 21, 135, 2470, 175428, 52980624
Offset: 1

Views

Author

Keywords

References

  • H. M. Gurk and J. R. Isbell. 1959. Simple Solutions. In A. W. Tucker and R. D. Luce (eds.) Contributions to the Theory of Games, Volume 4. Princeton, NJ: Princeton University Press, pp. 247-265. (Case n=6.)
  • 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 23. (Cases until n=9.)
  • 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).
  • J. von Neumann and O. Morgenstern, Theory of games and economic behavior, Princeton University Press, New Jersey, 1944. (Cases n=1 to 5.)

Crossrefs

Formula

a(n) = Sum_{k=1..n} A003184(k). - Alastair D. King, Oct 26 2023

Extensions

a(10) added by W. Lan (wl(AT)fjrtvu.edu.cn), Jun 27 2010
Better description from Alastair King, Mar 17 2023.

A003187 Number of positive threshold functions of n variables.

Original entry on oeis.org

3, 5, 10, 27, 119
Offset: 1

Views

Author

Keywords

Comments

Michael Somos (Mar 13 2012) asks if this sequence and A132183 are the same. - N. J. A. Sloane, Mar 13 2012

References

  • S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 214.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. A132183.

A189359 Number of homogeneous games for n players.

Original entry on oeis.org

0, 1, 3, 8, 23, 76, 293, 1307, 6642, 37882
Offset: 0

Views

Author

Fabián Riquelme, Apr 20 2011

Keywords

Crossrefs

Subclass of A000617. Cf. A001532, A022493, A109456, A132183.

Formula

Conjecture: g.f.: Q(0)*x/(1-x), where Q(k) = 1 + (1-(1-x)^(2*k+2))/(1- (1-(1-x)^(2*k+3))/(1-(1-x)^(2*k+3) + 1/Q(k+1))); (continued fraction). - Sergei N. Gladkovskii, May 13 2013
Note that a(n) - a(n-1) = A022493(n) for 1 <= n <= 9. Does this equality hold for n > 9? If so, then we have the g.f. 1/(1 - x)*( Sum_{n >= 1} Product_{k = 1..n} (1 - (1 - x)^k) ). - Peter Bala, Dec 13 2021

A211865 Arises in computing maximum information a Boolean function can reveal about noisy inputs.

Original entry on oeis.org

5, 10, 25, 119, 1173, 44315
Offset: 2

Views

Author

Jonathan Vos Post, Feb 11 2013

Keywords

Comments

From Table I: Reduction in number of candidate Boolean functions to be considered for verification of Conjecture 2, Kumar.

Examples

			a(4) = 25 because only 25 Boolean functions need to be examined for the conjecture, from 65536 on 4 variables.
		

Crossrefs

Cf. A003187 and A132183 (similar).
Showing 1-4 of 4 results.