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.

A189609 Number of n X 8 array permutations with each element not moving, or moving one space E, S or NW.

Original entry on oeis.org

1, 277, 11568, 671452, 36212912, 1968061359, 106717857552, 5778059258273, 312573095738121, 16898643737922425, 913264073225048477, 49345410349072594251, 2665888554266786412238, 144014204839657901069783
Offset: 1

Views

Author

R. H. Hardin, Apr 24 2011

Keywords

Comments

Column 8 of A189610.

Examples

			Some solutions for 3 X 8
..9..0..2.12..4..5..6..7....9..0..2.12.13.14..5..7....0..1.11.12..3..5.15..6
.17..1.19..3.11.22.13.15...17..1.10..3..4.22..6.15....8..9..2.10..4.13.14..7
..8.16.10.18.20.21.14.23....8.16.18.11.19.20.21.23...16.17.18.19.20.21.22.23
		

Crossrefs

Cf. A189610.