|
%I M1708 #22 Oct 04 2017 00:26:04
%S 2,6,38,526,12022,376430,14821942,700501294,38564486966,2421312598894,
%T 170655141398326,13336218401711534,1144162670908970806,
%U 106893046255965640174,10800877688088297157430,1173551859231328950561838,136431643427143746045393718
%N Number of fanout-free Boolean functions of n variables.
%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) * A005616(k). [From Kodandapani and Seth] - _Sean A. Irvine_, Jul 21 2016
%Y Cf. A005616.
%K nonn
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Sean A. Irvine_, Jul 21 2016
|
