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 A005741 M3532 #32 Apr 04 2025 11:09:08 %S A005741 2,4,16,160,3112,89488,3358600,154925968,8469271816,535078978000, %T A005741 38352590740744,3074533743260944,272548937753080072, %U A005741 26471366143068858448,2795374966070961592072,318874907420330435803024,39075835592493074367768328 %N A005741 Number of fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates. %D A005741 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005741 Andrew Howroyd, <a href="/A005741/b005741.txt">Table of n, a(n) for n = 0..200</a> %H A005741 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 A005741 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %F A005741 a(n) = A005617(n) + A005740(n). - _Sean A. Irvine_, Jul 21 2016 %F A005741 Binomial transform of A005617. - _Andrew Howroyd_, Mar 29 2025 %Y A005741 Cf. A005617, A005740. %K A005741 nonn %O A005741 0,1 %A A005741 _N. J. A. Sloane_ %E A005741 More terms from _Sean A. Irvine_, Jul 21 2016 %E A005741 a(0)=2 prepended and name clarified by _Andrew Howroyd_, Mar 29 2025 %E A005741 a(16) from _Alois P. Heinz_, Mar 29 2025