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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005740 Number of fanout-free Boolean functions of n variables.
(Formerly M1709)
1
2, 6, 38, 558, 14102, 493230, 21734582, 1150168974, 70917337622, 4987580274414, 393796969969526, 34476778683241806, 3313919458048503254, 346878958323336066222, 39271056622439364321590, 4780894577220073271485710 (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..16.

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) * A005617(k). - Sean A. Irvine, Jul 21 2016

CROSSREFS

Sequence in context: A184731 A005738 A055704 * A006536 A057297 A005530

Adjacent sequences:  A005737 A005738 A005739 * A005741 A005742 A005743

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 20 03:05 EDT 2019. Contains 328244 sequences. (Running on oeis4.)