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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005741 Number of fanout-free Boolean functions of n variables.
(Formerly M3532)
0
4, 16, 160, 3112, 89488, 3358600, 154925968, 8469271816, 535078978000, 38352590740744, 3074533743260944, 272548937753080072, 26471366143068858448, 2795374966070961592072, 318874907420330435803024 (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..15.

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

CROSSREFS

Sequence in context: A279887 A226588 A318641 * A033911 A130691 A012916

Adjacent sequences:  A005738 A005739 A005740 * A005742 A005743 A005744

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 20 20:54 EST 2018. Contains 317422 sequences. (Running on oeis4.)