cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 288, 456, 768, 1508, 3434, 7560, 16024, 31872, 61704, 122464, 246296, 500506, 1015010, 2041372, 4098824, 8224718, 16535378, 33298104, 67036986, 134932118, 271438490, 545959366, 1098340012, 2209778140
Offset: 0

Views

Author

R. H. Hardin, Oct 24 2015

Keywords

Examples

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

Crossrefs

Diagonal of A263703.
Cf. A333833.

Extensions

a(0), a(23)-a(29) from Alois P. Heinz, Apr 08 2020