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-2 of 2 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.

A189360 Number of self-dual homogeneous games for n players.

Original entry on oeis.org

0, 1, 1, 2, 3, 7, 21, 132, 2188
Offset: 0

Views

Author

Fabián Riquelme, Apr 20 2011

Keywords

Comments

Found by F. Riquelme

Crossrefs

Intersection of A189359 and A109456.
Showing 1-2 of 2 results.