Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M3532 #20 Oct 04 2017 00:24:54
%S 4,16,160,3112,89488,3358600,154925968,8469271816,535078978000,
%T 38352590740744,3074533743260944,272548937753080072,
%U 26471366143068858448,2795374966070961592072,318874907420330435803024
%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) = A005617(n) + A005740(n). - _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