login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A360384 Number of permutations p of [n] satisfying |p(i+7) - p(i)| <> 7 for all 1 <= i <= n-7. 1

%I #20 Feb 08 2023 09:09:46

%S 1,1,2,6,24,120,720,5040,38880,323520,2953728,29666304,326584320,

%T 3919011840,50969640960,705722941440,10504707686400,167258901086208,

%U 2836455721721856,51038126752727040,971132188892405760

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

%H 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 Column k=7 of A333706.

%Y Cf. A110128.

%K nonn,hard,more

%O 0,3

%A _Seiichi Manyama_, Feb 05 2023

%E a(12)-a(20) from _Alois P. Heinz_, Feb 07 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 09:39 EDT 2024. Contains 374274 sequences. (Running on oeis4.)