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 A367447 #5 Nov 19 2023 10:33:51
%S A367447 1,9,102,1529,28702
%N A367447 Number of discrete implications I:L_n^2-> L_n defined on the finite chain L_n={0,1,...n}, which satisfy the law of importation with respect to a discrete t-norm T, i.e., I(T(x,y),z)=I(x,I(y,z)), for all x,y in L_n.
%C A367447 Number of discrete implications I:L_n^2->L_n defined on the finite chain L_n={0,1,...,n} satisfying the law of importation with respect to a discrete t-norm T, i.e., the number of binary functions I:L_n^2->L_n such that I is decreasing in the first argument, increasing in the second argument, I(0,0)=I(n,n)=n and I(n,0)=0 (discrete implication), and I(T(x,y),z)=I(x,I(y,z)), for all x,y,z in L_n (law of importation with respect to a discrete t-norm T). A discrete t-norm T is a binary operator T:L_n^2->L_n such that T is increasing in each argument, commutative (T(x,y)=T(y,x) for all x,y in L_n), associative (T(x,T(y,z))=T(T(x,y),z) for all x,y,z in L_n) and has neutral element n (T(x,n)=x for all x in L_n).
%H A367447 M. Munar, S. Massanet and D. Ruiz-Aguilera, <a href="https://doi.org/10.1016/j.fss.2023.01.004">A review on logical connectives defined on finite chains</a>, Fuzzy Sets and Systems, Volume 462, 2023.
%Y A367447 Particular case of the enumeration of discrete implications in general, enumerated in A360612.
%K A367447 nonn,hard,more
%O A367447 1,2
%A A367447 _Marc Munar_, Nov 18 2023