Number of permutations (p_1, ..., p_n) of {1,...,n} that are "balanced" in the sense that the sum of k*p_k equals the sum of (n+1-k)*p_k; equivalently, the expected value of k*p_k is (expected value of k) times (expected value of p_k), assuming the uniform distribution.
a(4k+2) = 0; also, the same sequence enumerates permutations of {0,1,...,n-1} with the stated expected value property.
Also, central coefficients in the expansion of the probability generating function for the exact null distribution of Spearman's rho. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 14 2002
a(n) is the central term in row n of A175929 if n in { A042965 } and a(n)=0 otherwise. - Alois P. Heinz, Dec 12 2025
REFERENCES
D. E. Knuth, The Art of Computer Programming: Generating all tuples and permutations, Volume 4, Fascicle 2, Addison-Wesley, Upper Saddle River, NJ (2005); p. 74, Exercise 104.
Ivan Moscovich, More Brainmatics Logic Puzzles, see p. 130. - from Neven Juric, Jan 21 2010.
E. I. Marshall, Conditions for rank correlation to be zero, Sankhyā 56(1) (1994), 59-66; he proved that a(n) = 0 if and only if n = 3 or n = 4*k+2 for some integer k >= 0 (see Theorem 2, p. 62).