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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005737 Number of fanout-free Boolean functions of n variables.
(Formerly M1284)
1
2, 4, 14, 96, 1146, 19996, 456774, 12851768, 429005426, 16560937396, 725573492222, 35563025442192, 1927862644558314, 114519148531129036, 7397000893220477238, 516159025386346265192, 38694179227499561474786, 3101357948259644187134308 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

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) = A005736(n) + A005640(n+1). - Sean A. Irvine, Jul 21 2016

CROSSREFS

Cf. A005640, A005736.

Sequence in context: A166894 A232108 A032052 * A219767 A000609 A245079

Adjacent sequences:  A005734 A005735 A005736 * A005738 A005739 A005740

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 16 12:40 EST 2018. Contains 317272 sequences. (Running on oeis4.)