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”).
%I #4 Oct 30 2015 08:01:59
%S 1,2,3,11,17,70,108,483,739,3426,5216,24476,37233,176887,268945,
%T 1289725,1960265,9470869,14390851,69941272,106252224,518879732,
%U 788139368,3864186695,5868707734,28870387411,43842625518,216296687601,328444289911
%N Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and the total absolute value of displacements not greater than n.
%C Column 5 of A263939.
%H R. H. Hardin, <a href="/A263936/b263936.txt">Table of n, a(n) for n = 1..177</a>
%e Some solutions for n=7
%e ..1....0....0....0....2....1....2....0....1....3....0....1....2....0....2....1
%e ..0....2....2....1....0....2....1....1....3....0....1....0....1....1....1....0
%e ..2....3....1....3....1....0....0....2....0....2....2....2....0....2....3....3
%e ..3....1....5....2....3....4....3....6....2....1....3....4....3....4....0....2
%e ..6....5....4....6....4....3....4....3....4....4....6....3....5....3....4....5
%e ..4....4....3....4....6....5....5....5....5....5....5....5....4....6....5....4
%e ..5....6....6....5....5....6....6....4....6....6....4....6....6....5....6....6
%Y Cf. A263939.
%K nonn
%O 1,2
%A _R. H. Hardin_, Oct 30 2015