login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005738 Number of fanout-free Boolean functions of n variables.
(Formerly M1708)
2
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 A006536

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 22:34 EDT 2019. Contains 328335 sequences. (Running on oeis4.)