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 A005738 M1708 #28 Apr 03 2025 23:04:53
%S A005738 0,2,6,38,526,12022,376430,14821942,700501294,38564486966,
%T A005738 2421312598894,170655141398326,13336218401711534,1144162670908970806,
%U A005738 106893046255965640174,10800877688088297157430,1173551859231328950561838,136431643427143746045393718
%N A005738 Number of degenerate fanout-free Boolean functions of n variables using And, Or, Xor, and Not gates.
%C A005738 Number of degenerate disjunctively-realizable functions of n variables.
%D A005738 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005738 Andrew Howroyd, <a href="/A005738/b005738.txt">Table of n, a(n) for n = 0..200</a>
%H A005738 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 A005738 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%F A005738 a(n) = Sum_{k=0..n-1} binomial(n,k) * A005616(k). [From Kodandapani and Seth] - _Sean A. Irvine_, Jul 21 2016
%F A005738 a(n) = A005739(n) - A005616(n). - _Andrew Howroyd_, Apr 03 2025
%Y A005738 Cf. A005616, A005739.
%K A005738 nonn
%O A005738 0,2
%A A005738 _N. J. A. Sloane_
%E A005738 More terms from _Sean A. Irvine_, Jul 21 2016
%E A005738 a(0) prepended and definition clarified by _Andrew Howroyd_, Apr 03 2025