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.

A188963 Number of nX2 array permutations with each element moved and moved by a city block distance of no more than three.

Original entry on oeis.org

1, 9, 265, 8132, 154564, 2790864, 55327556, 1139362932, 23084210737, 461656617041, 9241940662537, 185683704600857, 3732662042406464, 74976134234530448, 1505525933241030176, 30234928280320748560
Offset: 1

Views

Author

R. H. Hardin Apr 14 2011

Keywords

Comments

Column 2 of A188966

Examples

			Some solutions for 3X2
..3..0....1..0....2..4....5..2....1..0....5..3....2..5....3..4....3..4....5..3
..4..5....4..2....5..0....3..4....5..4....1..4....3..4....0..2....5..1....0..2
..1..2....5..3....1..3....0..1....2..3....0..2....0..1....5..1....2..0....1..4