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 A005743 M3491 #28 Apr 04 2025 01:19:37 %S A005743 2,4,14,104,1498,32876,950054,33801424,1426158002,69573363284, %T A005743 3851708875582,238539414903224,16338422029336970,1226232142235080636, %U A005743 100069553388048443990,8822157207387535459616,835558086134404986368866,84609374709488540680125092 %N A005743 Number of fanout-free Boolean functions of n variables using And, Or, Not and Majority gates. %C A005743 Kodandapani and Seth give incorrect a(7) = 33304122 (a consequence of former incorrect A005742(7)). %D A005743 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005743 Andrew Howroyd, <a href="/A005743/b005743.txt">Table of n, a(n) for n = 0..200</a> %H A005743 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 A005743 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %F A005743 a(n) = A005615(n) + A005742(n). - _Sean A. Irvine_, Jul 21 2016 %F A005743 Binomial transform of A005615. - _Andrew Howroyd_, Mar 29 2025 %Y A005743 Cf. A005615, A005742. %K A005743 nonn %O A005743 0,1 %A A005743 _N. J. A. Sloane_ %E A005743 a(7) corrected and more terms from _Sean A. Irvine_, Jul 21 2016 %E A005743 a(0)=2 prepended and name clarified by _Andrew Howroyd_, Mar 29 2025