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 A005739 M3531 #26 Apr 03 2025 23:04:49 %S A005739 2,4,16,152,2680,68968,2311640,95193064,4645069336,261938616104, %T A005739 16756882325464,1198897678224232,94851206834082200, %U A005739 8221740727881348520,774839374768829174104,78880995816162599086568,8626562553228821851608856 %N A005739 Number of disjunctively-realizable functions of n variables. %C A005739 Number of fanout-free Boolean functions of n variables using And, Or, Xor, and Not gates. - _Andrew Howroyd_, Apr 03 2025 %D A005739 K. L. Kodandapani and S. C. Seth, On combinational networks with restricted fan-out, IEEE Trans. Computers, C-27 (1978), 309-318. %D A005739 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005739 Andrew Howroyd, <a href="/A005739/b005739.txt">Table of n, a(n) for n = 0..200</a> %H A005739 J. T. Butler, <a href="/A006447/a006447.pdf">Letter to N. J. A. Sloane, Jun. 1975</a>. %H A005739 J. T. Butler, <a href="/A005613/a005613.pdf">On the number of functions realized by cascades and disjunctive networks</a>, IEEE Trans. Computers, C-24 (1975), 681-690. (Annotated scanned copy) %H A005739 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) %F A005739 a(n) = A005616(n) + A005738(n) [From Kodandapani and Seth]. - _Sean A. Irvine_, Jul 21 2016 %F A005739 Binomial transform of A005616. - _Andrew Howroyd_, Apr 03 2025 %Y A005739 Cf. A005616, A005738. %K A005739 nonn %O A005739 0,1 %A A005739 _N. J. A. Sloane_ %E A005739 More terms from _Sean A. Irvine_, Jul 21 2016 %E A005739 a(0)=2 prepended by _Andrew Howroyd_, Apr 03 2025