The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Oct 26 2015 06:34:24
%S 0,0,0,0,0,1,3,11,31,93,248,670,1724,4434,11120,27772,68402,167695,
%T 407659,986955,2376323,5702352,13631753,32500113,77272919,183336571,
%U 434092838,1026096990,2421667040,5707720617,13436324063,31596325769
%N 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 Column 2 of A263787
%H R. H. Hardin, <a href="/A263781/b263781.txt">Table of n, a(n) for n = 1..210</a>
%e All solutions for n=7
%e ..2....0....2
%e ..0....3....0
%e ..1....1....1
%e ..5....2....3
%e ..3....6....6
%e ..4....4....4
%e ..6....5....5
%Y Cf. A263787
%K nonn
%O 1,7
%A _R. H. Hardin_, Oct 26 2015