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 A005737 M1284 #31 Mar 29 2025 13:55:37 %S A005737 2,4,14,96,1146,19996,456774,12851768,429005426,16560937396, %T A005737 725573492222,35563025442192,1927862644558314,114519148531129036, %U A005737 7397000893220477238,516159025386346265192,38694179227499561474786,3101357948259644187134308 %N A005737 Number of fanout-free Boolean functions of n variables using And, Or and Not gates. %D A005737 J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709. %D A005737 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005737 Andrew Howroyd, <a href="/A005737/b005737.txt">Table of n, a(n) for n = 0..200</a> %H A005737 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 A005737 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %F A005737 a(n) = A005736(n) + A005640(n+1). - _Sean A. Irvine_, Jul 21 2016 %F A005737 Binomial transform of A224766. - _Andrew Howroyd_, Mar 29 2025 %Y A005737 Cf. A005640, A005736, A224766. %K A005737 nonn %O A005737 0,1 %A A005737 _N. J. A. Sloane_ %E A005737 More terms from _Sean A. Irvine_, Jul 21 2016