login
Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and the average of every three consecutive elements is never greater than the median of the previous three elements
1

%I #4 Oct 25 2015 07:30:49

%S 1,2,6,14,38,127,411,815,1166,561,303,297,110,219,497,390,783,1675,

%T 1173,2182,4337,2911,6004,12368,8233,16690,34526,24029,46954,95071,

%U 65332,129995,263677,179653,359720,736451,505953,1004246,2044459,1406750

%N Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and the average of every three consecutive elements is never greater than the median of the previous three elements

%C Column 6 of A263736

%H R. H. Hardin, <a href="/A263732/b263732.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 4*a(n-3) -5*a(n-6) +12*a(n-9) -27*a(n-12) +18*a(n-15) -17*a(n-18) +52*a(n-21) -36*a(n-24) -2*a(n-27) -18*a(n-30) +24*a(n-33) -4*a(n-39) for n>64

%e Some solutions for n=7

%e ..0....6....5....6....4....1....1....3....4....5....5....2....6....5....5....6

%e ..6....5....4....0....1....5....3....5....0....3....4....6....4....4....6....3

%e ..5....3....6....5....6....4....5....6....5....6....6....5....5....6....0....5

%e ..4....2....1....4....3....2....0....2....6....2....3....4....3....3....3....4

%e ..2....4....3....3....0....6....4....4....3....0....0....3....2....1....4....0

%e ..1....1....2....2....5....3....6....1....2....4....1....0....0....0....2....1

%e ..3....0....0....1....2....0....2....0....1....1....2....1....1....2....1....2

%Y Cf. A263736

%K nonn

%O 1,2

%A _R. H. Hardin_, Oct 25 2015