cp's OEIS Frontend

A263781 Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and exactly two more elements moved upwards than downwards.

%I A263781 #7 Jul 23 2025 15:38:14
%S A263781 0,0,0,0,0,1,3,11,31,93,248,670,1724,4434,11120,27772,68402,167695,
%T A263781 407659,986955,2376323,5702352,13631753,32500113,77272919,183336571,
%U A263781 434092838,1026096990,2421667040,5707720617,13436324063,31596325769
%N A263781 Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and exactly two more elements moved upwards than downwards.
%C A263781 Column 2 of A263787
%H A263781 R. H. Hardin, <a href="/A263781/b263781.txt">Table of n, a(n) for n = 1..210</a>
%e A263781 All solutions for n=7
%e A263781 ..2....0....2
%e A263781 ..0....3....0
%e A263781 ..1....1....1
%e A263781 ..5....2....3
%e A263781 ..3....6....6
%e A263781 ..4....4....4
%e A263781 ..6....5....5
%Y A263781 Cf. A263787
%K A263781 nonn
%O A263781 1,7
%A A263781 _R. H. Hardin_, Oct 26 2015