A005737 Number of fanout-free Boolean functions of n variables using And, Or and Not gates. (Formerly M1284)

2, 4, 14, 96, 1146, 19996, 456774, 12851768, 429005426, 16560937396, 725573492222, 35563025442192, 1927862644558314, 114519148531129036, 7397000893220477238, 516159025386346265192, 38694179227499561474786, 3101357948259644187134308

Offset

0,1

References

J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709.

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

Links

Andrew Howroyd, Table of n, a(n) for n = 0..200

K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318. (Annotated scanned copy)

Index entries for sequences related to Boolean functions

Formula

a(n) = A005736(n) + A005640(n+1). - Sean A. Irvine, Jul 21 2016

Binomial transform of A224766. - Andrew Howroyd, Mar 29 2025

Crossrefs

Cf. A005640, A005736, A224766.

Sequence in context: A232108 A339651 A032052 * A219767 A005743 A000609

Adjacent sequences: A005734 A005735 A005736 * A005738 A005739 A005740

Keyword

nonn

Author

N. J. A. Sloane

Extensions

More terms from Sean A. Irvine, Jul 21 2016

Status

approved