This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A005740 M1709 #25 Mar 29 2025 14:13:20
%S A005740 2,6,38,558,14102,493230,21734582,1150168974,70917337622,
%T A005740 4987580274414,393796969969526,34476778683241806,3313919458048503254,
%U A005740 346878958323336066222,39271056622439364321590,4780894577220073271485710
%N A005740 Number of degenerate fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates.
%D A005740 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005740 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 A005740 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%F A005740 a(n) = Sum_{k=0..n-1} binomial(n,k) * A005617(k). - _Sean A. Irvine_, Jul 21 2016
%Y A005740 Cf. A005617, A005741.
%K A005740 nonn
%O A005740 1,1
%A A005740 _N. J. A. Sloane_
%E A005740 More terms from _Sean A. Irvine_, Jul 21 2016