%I M1284 #26 Oct 04 2017 00:27:15
%S 2,4,14,96,1146,19996,456774,12851768,429005426,16560937396,
%T 725573492222,35563025442192,1927862644558314,114519148531129036,
%U 7397000893220477238,516159025386346265192,38694179227499561474786,3101357948259644187134308
%N Number of 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) = A005736(n) + A005640(n+1). - _Sean A. Irvine_, Jul 21 2016
%Y Cf. A005640, A005736.
%K nonn
%O 0,1
%A _N. J. A. Sloane_
%E More terms from _Sean A. Irvine_, Jul 21 2016