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 A141473 #18 Oct 01 2024 03:24:49 %S A141473 6,2,2,0,0,4,2,0,0 %N A141473 Number of 3-equitable permutations: permutations on n letters equally avoiding each permutation of S_3. %C A141473 A permutation is 3-equitable if no omega in S_3 appears more than ceiling(binomial(n,3)/6) times or fewer than floor(binomial(n,3)/6) times. %C A141473 E.g., 2143 contains 214, 213--213 permutations--and 243 and 143--both 132 permutations. %C A141473 This is a generalization of the Kendall-Mann numbers A000140. %H A141473 Sunil Abraham, <a href="/A141473/a141473.txt">Maple program</a> %e A141473 The only 3-equitable permutations in S_4: [3, 1, 4, 2], [2, 4, 1, 3]. %Y A141473 Cf. A000140. %K A141473 nonn,hard,more %O A141473 3,1 %A A141473 Sunil Abraham (sunil.abraham(AT)lmh.ox.ac.uk), Aug 08 2008