Voozh

A005743

Number of fanout-free Boolean functions of n variables using And, Or, Not and Majority gates.

2, 4, 14, 104, 1498, 32876, 950054, 33801424, 1426158002, 69573363284, 3851708875582, 238539414903224, 16338422029336970, 1226232142235080636, 100069553388048443990, 8822157207387535459616, 835558086134404986368866, 84609374709488540680125092

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

Kodandapani and Seth give incorrect a(7) = 33304122 (a consequence of former incorrect A005742(7)).

REFERENCES

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) = A005615(n) + A005742(n). - Sean A. Irvine, Jul 21 2016

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

CROSSREFS

Cf. A005615, A005742.

Sequence in context: A032052 A005737 A219767 * A000609 A245079 A167008

Adjacent sequences: A005740 A005741 A005742 * A005744 A005745 A005746

KEYWORD

nonn

AUTHOR

N. J. A. Sloane