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 A224766 #14 Mar 29 2025 12:43:23 %S A224766 2,2,8,64,832,15104,352256,10037248,337936384,13126565888, %T A224766 577818263552,28425821618176,1545553369366528,92034646352592896, %U A224766 5956917762776367104,416397789920380321792,31262503202358260924416,2508985620606225641111552,214348807882902869374926848 %N A224766 Number of non-degenerate fanout-free Boolean functions of n variables using And, Or and Not gates. %C A224766 Apart from initial term and offset, same as A005640, which is the main entry for this sequence. %D A224766 J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709. %H A224766 Andrew Howroyd, <a href="/A224766/b224766.txt">Table of n, a(n) for n = 0..200</a> %F A224766 a(n) = 2*A005172(n) for n > 0. - _Andrew Howroyd_, Mar 28 2025 %o A224766 (PARI) seq(n) = Vec(2*serlaplace(1 - x + serreverse((1 + 2*x - exp(x + O(x*x^n)))/2))) \\ _Andrew Howroyd_, Mar 28 2025 %Y A224766 Row sums of A225171. %Y A224766 Cf. A005172, A005640, A005736, A005737, A225170. %K A224766 nonn %O A224766 0,1 %A A224766 _N. J. A. Sloane_, Apr 30 2013 %E A224766 Name clarified and a(19) onwards from _Andrew Howroyd_, Mar 28 2025