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 A316775 #32 Jul 06 2023 01:58:18
%S A316775 1,1,0,0,6,22,0,0,3836,29228,0,0,25598186,296643390,0,0,738680521142,
%T A316775 11501573822788,0,0,62119523114983224,1214967840930909302,0,0,
%U A316775 12140037056605135928410,285899248139692651257566,0,0,4759461354691529363949651814
%N A316775 a(n) is the number of permutations of [1..n] that have the same number of inversions as non-inversions.
%C A316775 a(n) is zero when n choose 2 is odd, that is for numbers that have remainders 2 or 3 when divided by 4.
%H A316775 Gal Beniamini, Nir Lavee, and Nati Linial, <a href="https://arxiv.org/abs/2306.16954">How Balanced Can Permutations Be?</a>, arXiv:2306.16954 [math.CO], 2023. See p. 18.
%H A316775 Tanya Khovanova, <a href="https://blog.tanyakhovanova.com/2018/10/3-symmetric-permutations/#comment-12716">3-Symmetric Permutations</a>
%H A316775 Wikipedia, <a href="https://en.wikipedia.org/wiki/Inversion_(discrete_mathematics)">Inversion</a>
%F A316775 a(n) = A000140(n) if n in { A042948 }. - _Alois P. Heinz_, Oct 25 2018
%e A316775 Consider a permutation 1432. It has exactly three pairs of numbers, the first of them is 1, that are in increasing order. The other three pairs are in decreasing order. The other 5 permutations of size 4 with this property are 2341, 2413, 3142, 3214, 4123. Thus a(4) = 6.
%Y A316775 Cf. A000140, A042948.
%K A316775 nonn
%O A316775 0,5
%A A316775 _Tanya Khovanova_, Oct 22 2018
%E A316775 a(10)-a(15) from _Giovanni Resta_, Oct 22 2018
%E A316775 a(16)-a(28) from _Alois P. Heinz_, Oct 24 2018