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.

A263781 Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and exactly two more elements moved upwards than downwards.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 3, 11, 31, 93, 248, 670, 1724, 4434, 11120, 27772, 68402, 167695, 407659, 986955, 2376323, 5702352, 13631753, 32500113, 77272919, 183336571, 434092838, 1026096990, 2421667040, 5707720617, 13436324063, 31596325769
Offset: 1

Views

Author

R. H. Hardin, Oct 26 2015

Keywords

Comments

Column 2 of A263787

Examples

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

Crossrefs