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.

A263525 Number of (7+1)X(n+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

1575, 240237, 53712998, 9866744449, 1805523575884, 319022980139204, 55588636099730695, 9567638169477949121, 1633596504493958096947, 277222641856926258001248, 46832138508130606828637749
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Row 7 of A263519.

Examples

			Some solutions for n=1
..0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1....0..1
..4..2....2..5....4..2....4..2....3..2....3..2....2..5....3..2....3..2....2..3
..5..3....4..3....6..3....5..3....4..5....4..5....4..3....4..7....5..4....5..4
..6..9....6..7....7..5....6..7....6..9....6..7....6..7....6..5....8..6....6..7
..8..7....8..9....8..9...10..8....8..7....8.11...10..8....8..9....9..7....9..8
.10.11...10.11...12.10...11..9...11.10...10..9...12..9...10.11...10.11...10.11
.12.13...13.12...13.11...12.13...13.12...12.15...13.11...13.12...13.12...12.13
.15.14...14.15...15.14...14.15...15.14...14.13...15.14...15.14...14.15...14.15
		

Crossrefs

Cf. A263519.