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 A224767 #15 Mar 28 2025 22:54:08 %S A224767 8,96,1760,41280,1180928,39875584,1552320512,68449628160, %T A224767 3372052676608,183551641878528,10940489276194816,708687880636596224, %U A224767 49572421008089939968,3724036897414481707008,299029855691955400343552,25558593192866693643239424,2316797640852393238300983296 %N A224767 Number of non-degenerate fanout-free Boolean functions of n variables having AND rank 3. %D A224767 J. P. Hayes, Enumeration of fanout-free Boolean functions, J. ACM, 23 (1976), 700-709. %H A224767 Andrew Howroyd, <a href="/A224767/b224767.txt">Table of n, a(n) for n = 3..200</a> %H A224767 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %F A224767 Hayes (1976, Theorem 3) gives a recurrence. %Y A224767 Column 3 of A225171. %K A224767 nonn %O A224767 3,1 %A A224767 _N. J. A. Sloane_, Apr 30 2013 %E A224767 a(9) onwards from _Andrew Howroyd_, Mar 28 2025