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

1, 2, 6, 24, 78, 110, 169, 301, 616, 1373, 2908, 5908, 11544, 22644, 45460, 91977, 186645, 376625, 756105, 1518054, 3049762, 6137766, 12359571, 24876504, 50054780, 100682624, 202531226, 407477585, 819858684, 1649639041, 3319062167

Offset

1,2

Comments

Column 3 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>27

Example

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

Crossrefs

Cf. A263703.

Sequence in context: A147929 A147921 A263712 * A263747 A002526 A324373

Adjacent sequences: A263695 A263696 A263697 * A263699 A263700 A263701

Keyword

nonn

Author

R. H. Hardin, Oct 24 2015

Status

approved