login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of permutations p of [n] such that max_{j=1..n} |p(j)-j| = 10.
2

%I #7 Jan 28 2019 18:31:02

%S 0,6894720,125516160,1586345040,16759964880,158705713320,

%T 1400777573016,11828309150490,97341704612482,791331470025483,

%U 6418149695049249,52479230675397803,435575075749110957,3649912769065068556,30745771540084745428,259496462836442105424

%N Number of permutations p of [n] such that max_{j=1..n} |p(j)-j| = 10.

%H Alois P. Heinz, <a href="/A323806/b323806.txt">Table of n, a(n) for n = 10..100</a>

%F a(n) = A154659(n) - A154658(n).

%Y Column k=10 of A130152.

%Y Cf. A154658, A154659.

%K nonn

%O 10,2

%A _Alois P. Heinz_, Jan 28 2019