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”).

A005741
Number of fanout-free Boolean functions of n variables.
(Formerly M3532)
0
4, 16, 160, 3112, 89488, 3358600, 154925968, 8469271816, 535078978000, 38352590740744, 3074533743260944, 272548937753080072, 26471366143068858448, 2795374966070961592072, 318874907420330435803024
OFFSET
1,1
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, 27 (1978), 309-318. (Annotated scanned copy)
FORMULA
a(n) = A005617(n) + A005740(n). - Sean A. Irvine, Jul 21 2016
CROSSREFS
Sequence in context: A226588 A367279 A318641 * A033911 A130691 A308239
KEYWORD
nonn
EXTENSIONS
More terms from Sean A. Irvine, Jul 21 2016
STATUS
approved