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 A360386 #18 Feb 08 2023 09:17:33 %S A360386 1,1,2,6,24,120,720,5040,40320,352800,3312000,33742080,373948416, %T A360386 4498421760,58506854400,819095961600,12290021130240,194999390208000, %U A360386 3294723692298240,59059379675381760,1119453588069875712 %N A360386 Number of permutations p of [n] satisfying |p(i+8) - p(i)| <> 8 for all 1 <= i <= n-8. %H A360386 Roberto Tauraso, <a href="http://www.emis.de/journals/INTEGERS/papers/g11/g11.Abstract.html">The Dinner Table Problem: The Rectangular Case</a>, INTEGERS: Electronic Journal of Combinatorial Number Theory, Vol. 6 (2006), #A11. %Y A360386 Column k=8 of A333706. %Y A360386 Cf. A110128. %K A360386 nonn,more,hard %O A360386 0,3 %A A360386 _Seiichi Manyama_, Feb 05 2023 %E A360386 a(12)-a(20) from _Alois P. Heinz_, Feb 07 2023