A263700 Number of length n arrays of permutations of 0..n-1 with each element moved by -5 to 5 places and every three consecutive elements having its maximum within 4 of its minimum.

1, 2, 6, 24, 120, 288, 276, 374, 732, 1673, 3692, 7784, 15360, 29532, 58532, 118037, 240313, 487649, 980297, 1966710, 3945522, 7932930, 15978403, 32172852, 64755796, 130259920, 261986262, 527049589, 1060407528, 2133708989, 4293197371

Offset

1,2

Comments

Column 5 of A263703.

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = a(n-1) +a(n-2) +7*a(n-5) +2*a(n-6) +a(n-7) +5*a(n-8) -4*a(n-9) -3*a(n-10) -3*a(n-11) -4*a(n-12) -4*a(n-14) -a(n-15) +3*a(n-16) -a(n-17) +a(n-19) for n>29

Example

Some solutions for n=7
..1....0....4....2....4....5....0....0....1....5....0....5....0....1....5....0
..0....1....6....0....0....1....1....1....0....2....3....6....1....0....6....1
..2....4....5....1....3....4....4....2....4....1....1....2....4....4....2....4
..3....5....2....4....1....0....2....5....2....0....5....4....2....2....3....5
..5....2....3....5....5....3....5....4....6....4....4....0....5....6....0....3
..6....3....0....6....2....2....3....3....5....3....6....1....6....3....1....6
..4....6....1....3....6....6....6....6....3....6....2....3....3....5....4....2

Crossrefs

Cf. A263703.

Sequence in context: A130480 A000804 A048631 * A263701 A263702 A263696

Adjacent sequences: A263697 A263698 A263699 * A263701 A263702 A263703

Keyword

nonn

Author

R. H. Hardin, Oct 24 2015

Status

approved