login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005616
Number of disjunctively-realizable functions of n variables.
(Formerly M1983)
2
2, 2, 10, 114, 2154, 56946, 1935210, 80371122, 3944568042, 223374129138, 14335569726570, 1028242536825906, 81514988432370666, 7077578056972377714, 667946328512863533930, 68080118128074301929138, 7453010693997492901047018
OFFSET
0,1
COMMENTS
Fanout-free Boolean functions of n variables using And, Or, Xor, and Not gates.
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
E. A. Bender and J. T. Butler, Asymptotic approximations for the number of fanout-free functions, IEEE Trans. Computers, 27 (1978), 1180-1183. (Annotated scanned copy)
J. T. Butler, Letter to N. J. A. Sloane, Jun. 1975 and Dec. 1978.
J. T. Butler, On the number of functions realized by cascades and disjunctive networks, IEEE Trans. Computers, C-24 (1975), 681-690. (Annotated scanned copy)
K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318. (Annotated scanned copy)
CROSSREFS
Cf. A005738.
Sequence in context: A002250 A304642 A005613 * A005617 A011248 A069240
KEYWORD
nonn
EXTENSIONS
a(0), a(14)-a(16) from Sean A. Irvine, Jul 21 2016
STATUS
approved