cp's OEIS Frontend

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.

A360384 Number of permutations p of [n] satisfying |p(i+7) - p(i)| <> 7 for all 1 <= i <= n-7.

This page as a plain text file.
%I A360384 #20 Feb 08 2023 09:09:46
%S A360384 1,1,2,6,24,120,720,5040,38880,323520,2953728,29666304,326584320,
%T A360384 3919011840,50969640960,705722941440,10504707686400,167258901086208,
%U A360384 2836455721721856,51038126752727040,971132188892405760
%N A360384 Number of permutations p of [n] satisfying |p(i+7) - p(i)| <> 7 for all 1 <= i <= n-7.
%H A360384 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 A360384 Column k=7 of A333706.
%Y A360384 Cf. A110128.
%K A360384 nonn,hard,more
%O A360384 0,3
%A A360384 _Seiichi Manyama_, Feb 05 2023
%E A360384 a(12)-a(20) from _Alois P. Heinz_, Feb 07 2023