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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005736 Number of degenerate fanout-free Boolean functions of n variables.
(Formerly M1697)
15
0, 2, 6, 32, 314, 4892, 104518, 2814520, 91069042, 3434371508, 147755228670, 7137203824016, 382309275191786, 22484502178536140, 1440083130444110134, 99761235465965943400, 7431676025141300550370, 592372327653418546022756 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

REFERENCES

J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709.

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=0..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) * s(k) where s(0)=2 and s(n) = A005640(n + 1) otherwise. - Sean A. Irvine, Jul 21 2016

CROSSREFS

Cf. A005640.

Sequence in context: A191712 A277475 A277484 * A123903 A172401 A272661

Adjacent sequences:  A005733 A005734 A005735 * A005737 A005738 A005739

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 17 18:58 EDT 2019. Contains 328127 sequences. (Running on oeis4.)