%I M1709 #22 Oct 04 2017 00:25:33
%S 2,6,38,558,14102,493230,21734582,1150168974,70917337622,
%T 4987580274414,393796969969526,34476778683241806,3313919458048503254,
%U 346878958323336066222,39271056622439364321590,4780894577220073271485710
%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) * A005617(k). - _Sean A. Irvine_, Jul 21 2016
%K nonn
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Sean A. Irvine_, Jul 21 2016