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.

A000609 Number of threshold functions of n or fewer variables.

Original entry on oeis.org

2, 4, 14, 104, 1882, 94572, 15028134, 8378070864, 17561539552946, 144130531453121108
Offset: 0

Views

Author

Keywords

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

Crossrefs

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.

Extensions

a(9) from Minfeng Wang, Jun 27 2010

A290946 Number of chambers of Hassett's decomposition of the weight domain of the moduli space of genus 0 n-pointed curves.

Original entry on oeis.org

1, 27, 1087, 105123, 31562520, 33924554539, 140306938682875
Offset: 3

Views

Author

Connor Halleck-Dube, Oct 20 2017

Keywords

Comments

a(n) is also the number of goldilocks linear threshold functions on n variables. Asymptotically equal to the total number of linear threshold functions on n variables, divided by 2^n.

Crossrefs

Formula

a(n) ~ 2^(n^2 - n log n + O(n)).
Showing 1-2 of 2 results.