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.

A188954 Number of nX3 array permutations with each element moved no more than a city block distance of two.

Original entry on oeis.org

6, 362, 29172, 1722256, 104735558, 6513224285, 402549615544, 24857280209008, 1535940257170788, 94903086891894000, 5863618342142622360, 362289547465186312038, 22384463811480689586560, 1383047351386729941046442
Offset: 1

Views

Author

R. H. Hardin Apr 14 2011

Keywords

Comments

Column 3 of A188958

Examples

			Some solutions for 4X3
..0..4..2....0..4..2....0..3..1....0..3..2....0..4..2....0..3..1....0..3..5
..9..8..1....5..8..3....5..7..2....7..5..1....3.10.11....9..2..4....6..2..7
..6..3..7....9..1.11....4.11..8....6.10..8....8..1..5....8.11..6...10..1..4
.11.10..5....7..6.10....6.10..9...11..4..9....7..6..9...10..7..5...11..9..8