The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005615 Number of fanout-free Boolean functions of n variables using And, Or, Not and Majority gates.
(Formerly M1899)

%I M1899

%S 2,2,8,72,1152,26304,773376,27792384,1180606464,57878949888,

%T 3216287711232,199772566437888,13715535726379008,1031385107381354496,

%U 84305991898648018944,7442748678347943837696,705753951277588515127296,71539473538360558749745152

%N Number of fanout-free Boolean functions of n variables using And, Or, Not and Majority gates.

%C A circuit is fanout-free if each gate's output is the input to (at most) one gate. - _Charles R Greathouse IV_, Jul 21 2016

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H E. A. Bender and J. T. Butler, <a href="/A005612/a005612.pdf">Asymptotic approximations for the number of fanout-free functions</a>, IEEE Trans. Computers, 27 (1978), 1180-1183. (Annotated scanned copy)

%H J. T. Butler, <a href="/A005607/a005607_1.pdf">Letter to N. J. A. Sloane, Dec. 1978</a>.

%H K. L. Kodandapani and S. C. Seth, <a href="http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675103">On combinational networks with restricted fan-out</a>, IEEE Trans. Computers, 27 (1978), 309-318. (<a href="/A005736/a005736.pdf">Annotated scanned copy</a>)

%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>

%K nonn

%O 0,1

%A _N. J. A. Sloane_

%E a(0), a(8)-a(17) from _Sean A. Irvine_, Jul 21 2016

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 June 22 21:29 EDT 2021. Contains 345393 sequences. (Running on oeis4.)