login
The OEIS is supported by the many generous donors 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
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) = Sum_{k=0..n-1} binomial(n,k) * A005617(k). - Sean A. Irvine, Jul 21 2016
CROSSREFS
Sequence in context: A184731 A005738 A055704 * A367904 A006536 A057297
KEYWORD
nonn
AUTHOR
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)