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!)
A005736 Number of degenerate fanout-free Boolean functions of n variables.
(Formerly M1697)
15

%I M1697 #25 Oct 04 2017 00:27:50

%S 0,2,6,32,314,4892,104518,2814520,91069042,3434371508,147755228670,

%T 7137203824016,382309275191786,22484502178536140,1440083130444110134,

%U 99761235465965943400,7431676025141300550370,592372327653418546022756

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

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

%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="/A005736/a005736.pdf">On combinational networks with restricted fan-out</a>, IEEE Trans. Computers, 27 (1978), 309-318. (Annotated scanned copy)

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

%Y Cf. A005640.

%K nonn

%O 0,2

%A _N. J. A. Sloane_

%E 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 09:14 EDT 2024. Contains 371268 sequences. (Running on oeis4.)