A005738 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A005738

Number of fanout-free Boolean functions of n variables.
(Formerly M1708)

2, 6, 38, 526, 12022, 376430, 14821942, 700501294, 38564486966, 2421312598894, 170655141398326, 13336218401711534, 1144162670908970806, 106893046255965640174, 10800877688088297157430, 1173551859231328950561838, 136431643427143746045393718

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

OFFSET

1,1

REFERENCES

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

LINKS

Table of n, a(n) for n=1..17.

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) = Sum_{k=0..n-1} binomial(n,k) * A005616(k). [From Kodandapani and Seth] - Sean A. Irvine, Jul 21 2016

CROSSREFS

Cf. A005616.

Sequence in context: A013703 A002031 A184731 * A055704 A005740 A367904

Adjacent sequences: A005735 A005736 A005737 * A005739 A005740 A005741

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Sean A. Irvine, Jul 21 2016

STATUS

approved