[go: up one dir, main page]

login
Number of disjunctively-realizable functions of n variables.
(Formerly M1983)
2

%I M1983 #36 Oct 04 2017 00:05:55

%S 2,2,10,114,2154,56946,1935210,80371122,3944568042,223374129138,

%T 14335569726570,1028242536825906,81514988432370666,

%U 7077578056972377714,667946328512863533930,68080118128074301929138,7453010693997492901047018

%N Number of disjunctively-realizable functions of n variables.

%C Fanout-free Boolean functions of n variables using And, Or, Xor, and Not gates.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H E. A. Bender and J. T. Butler, <a href="/A005612/a005612.pdf">Asymptotic approximations for the number of fanout-free functions</a>, IEEE Trans. Computers, 27 (1978), 1180-1183. (Annotated scanned copy)

%H J. T. Butler, Letter to N. J. A. Sloane, <a href="/A006447/a006447.pdf">Jun. 1975</a> and <a href="/A005607/a005607_1.pdf">Dec. 1978</a>.

%H J. T. Butler, <a href="http://dx.doi.org/10.1109/T-C.1975.224288">On the number of functions realized by cascades and disjunctive networks</a>, IEEE Trans. Computers, C-24 (1975), 681-690. (<a href="/A005613/a005613.pdf">Annotated scanned copy</a>)

%H K. L. Kodandapani and S. C. Seth, <a href="http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675103">On combinational networks with restricted fan-out</a>, IEEE Trans. Computers, 27 (1978), 309-318. (<a href="/A005736/a005736.pdf">Annotated scanned copy</a>)

%Y Cf. A005738.

%K nonn

%O 0,1

%A _N. J. A. Sloane_

%E a(0), a(14)-a(16) from _Sean A. Irvine_, Jul 21 2016