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 A372495 #33 May 02 2025 01:28:50 %S A372495 2,4,10,34,200,3466,829744 %N A372495 Number of inequivalent unate functions of n or fewer variables. %C A372495 A Boolean function is unate in a variable if it is either nondecreasing or nonincreasing with respect to that variable. Therefore in the circuit representation of unate functions, each variable appears either in its original form or in complemented form. Thus x⊕y = (x∧¬y)∨(¬x∧y) is not a unate function. %C A372495 Moreover, two Boolean functions are said to be equivalent if they are equivalent under the permutation of variables. For example, f(x,y)=x is equivalent to f(x,y)=y under the permutation of input variables. %H A372495 Aniruddha Biswas and Palash Sarkar, <a href="https://arxiv.org/abs/2304.14069">Counting unate and balanced monotone Boolean functions,</a> arXiv:2304.14069 [math.CO], 2023. %H A372495 Aniruddha Biswas and Palash Sarkar, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL28/Biswas/biswas6.html">Counting Unate and Monotone Boolean Functions Under Restrictions of Balancedness and Non-Degeneracy</a>, J. Int. Seq. (2025) Vol. 28, Art. No. 25.3.4. See pp. 4, 16. %H A372495 <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a> %e A372495 The list of all 2-variable inequivalent unate functions f(x,y) is 0,1,x,¬x,x∧y,¬x∧y,¬x∧¬y,x∨y,¬x∨y,¬x∨¬y. So a(2)=10. %Y A372495 Cf. A000372, A003182, A245079. %K A372495 nonn,hard,more %O A372495 0,1 %A A372495 _Aniruddha Biswas_, May 03 2024