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!)
A005742 Number of degenerate fanout-free Boolean functions of n variables.
(Formerly M1698)
1

%I M1698 #24 Oct 04 2017 00:24:20

%S 2,6,32,346,6572,176678,6009040,245551538,11694413396,635421164350,

%T 38766848465336,2622886302957962,194847034853726140,

%U 15763561489400425046,1379408529039591621920,129804134856816471241570,13069901171127981930379940

%N Number of degenerate fanout-free Boolean functions of n variables.

%C Kodandapani and Seth paper gives incorrect a(7) = 5511738.

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

%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>

%F a(n) = Sum_{k=0..n-1} binomial(n, k) * A005615(k). - _Sean A. Irvine_, Jul 21 2016

%K nonn

%O 1,1

%A _N. J. A. Sloane_

%E a(7) corrected and more terms 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)