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.

A263518 Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 filled by rows with each element moved a city block distance of 0 or 1, and rows and columns in increasing lexicographic order.

Original entry on oeis.org

159, 39807, 10791350, 2861438066, 769775248717, 206581153730159, 55588636099730695, 14963969410163493167, 4031070371116891657348, 1086255512881457026146614, 292787152002616412026152849
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Column 7 of A263519.

Examples

			Some solutions for n=2
..0..1..2..3..4..5..6..7....0..1..3..4.12.13.14.15....0..1..2..3..4..5..7.15
..8..9.10.11.12.13.15.14....8..9..2.10.11..5..6..7....9..8.11.10.20.13..6.23
.16.17.19.18.20.21.23.22...16.17.18.19.20.21.23.22...16.17.18.19.12.21.14.22
		

Crossrefs

Cf. A263519.