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 A005756 M3607 #29 Mar 28 2025 22:54:13 %S A005756 4,24,304,5440,125824,3566080,119614464,4633387008,203524112384, %T A005756 9995546722304,542730361241600,32281981804347392,2087454641985945600, %U A005756 145797871819529650176,10938609224992417644544,877346430770422497673216,74913579745878635293179904,6784650500440844952024383488 %N A005756 Number of non-degenerate fanout-free Boolean functions of n variables having AND rank 2. %D A005756 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005756 Andrew Howroyd, <a href="/A005756/b005756.txt">Table of n, a(n) for n = 2..200</a> %H A005756 J. P. Hayes, <a href="http://dx.doi.org/10.1145/321978.321988">Enumeration of fanout-free Boolean functions</a>, J. ACM, 23 (1976), 700-709. %H A005756 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %F A005756 Hayes (1976, Theorem 3) gives a recurrence. %Y A005756 Column 2 of A225171. %K A005756 nonn %O A005756 2,1 %A A005756 _N. J. A. Sloane_ %E A005756 More terms from _Sean A. Irvine_, Aug 26 2016 %E A005756 a(18) onwards from _Andrew Howroyd_, Mar 28 2025