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.

A000618 Number of nondegenerate Boolean functions of n variables: For n > 0, a(n) = A000616(n) - A000616(n-1).

This page as a plain text file.
%I A000618 M0160 N0063 #47 Apr 30 2025 10:13:56
%S A000618 2,1,3,16,380,1227756,400507805615570,
%T A000618 527471432057653003616766223882064,
%U A000618 11218076601767519586965281984173341005397671421797828020453197626398048
%N A000618 Number of nondegenerate Boolean functions of n variables: For n > 0, a(n) = A000616(n) - A000616(n-1).
%D A000618 S. Muroga, Threshold Logic and Its Applications. Wiley, NY, 1971, p. 38, Table 2.3.2. - Row 12.
%D A000618 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000618 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000618 Aniruddha Biswas and Palash Sarkar, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL28/Biswas/biswas6.html">Counting Unate and Monotone Boolean Functions Under Restrictions of Balancedness and Non-Degeneracy</a>, J. Int. Seq. (2025) Vol. 28, Art. No. 25.3.4. See p. 5.
%H A000618 Eiichi Goto and Hidetosi Takahasi, <a href="/A000371/a000371_1.pdf">Some Theorems Useful in Threshold Logic for Enumerating Boolean Functions</a>, in Proceedings International Federation for Information Processing (IFIP) Congress, 1962, pp. 747-752. [Annotated scans of certain pages]
%H A000618 Saburo Muroga, <a href="/A000371/a000371.pdf">Threshold Logic and Its Applications</a>, Wiley, NY, 1971 [Annotated scans of a few pages]
%H A000618 Saburo Muroga, T. Tsuboi and C. R. Baugh, <a href="/A002077/a002077.pdf">Enumeration of threshold functions of eight variables</a>, IEEE Trans. Computers, 19 (1970), 818-825. [Annotated scanned copy]
%H A000618 J. Sklansky, <a href="https://doi.org/10.1109/PGEC.1963.263627">General synthesis of tributary switching networks</a>, IEEE Trans. Elect. Computers, 12 (1963), 464-469.
%H A000618 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%F A000618 For n > 0, a(n) = A000616(n) - A000616(n-1). - _Charles R Greathouse IV_, Oct 03 2008
%Y A000618 Cf. A000371, A000616, A211705, A211706.
%K A000618 nonn,nice
%O A000618 0,1
%A A000618 _N. J. A. Sloane_
%E A000618 Edited and extended by _Charles R Greathouse IV_, Oct 03 2008