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 A075866 #25 Oct 30 2022 18:19:59
%S A075866 1,1,0,0,4,4,0,0,32,96,0,0,992,2512,0,0,50512,144144,0,0,3717888,
%T A075866 11068560,0,0,378849504,1269763552,0,0,51487458416,181839037824,0,0
%N A075866 Number of permutations s of {1,2,...,n} such that |s(i)-i| for i=1,2,...,n are all distinct.
%C A075866 a(n) = 0 iff n == 2,3 (mod 4).
%H A075866 H. A. Shah Ali, <a href="https://www.jstor.org/stable/3072405">Problem 10964</a>, Amer. Math. Monthly, 109 (2002), 759.
%F A075866 a(n) = A125183(n,n). - _Alois P. Heinz_, Feb 16 2019
%e A075866 a(8) = 32, since the following 32 permutations of {12345678} and no others, have the required property:
%e A075866 (87265314)(87361542)(87362514)(87364215)(87514632)(87531642)(87532614)
%e A075866 (87541362)(83765142)(85724613)(84752613)(85743162)(86275413)(86374152)
%e A075866 (86357142)(86542713)(48753621)(68275431)(68374251)(58376421)(58473621)
%e A075866 (68357241)(68542731)(58643721)(73865241)(75824631)(74852631)(75843261)
%e A075866 (73685421)(75386421)(75483621)(76358421).
%Y A075866 Cf. A125183.
%K A075866 more,nonn
%O A075866 0,5
%A A075866 _Reiner Martin_, Oct 15 2002
%E A075866 Extended and edited by _John W. Layman_, Oct 05 2004
%E A075866 a(17)-a(27) from _Al Zimmermann_, Aug 03 2007
%E A075866 a(28) through a(31) from _Al Zimmermann_, Aug 22 2007
%E A075866 a(0)=1 prepended by _Alois P. Heinz_, Feb 16 2019