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.

A263523 Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 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

190, 7022, 331130, 13332096, 529329240, 20339400914, 769775248717, 28769044462647, 1066167178758449, 39261521869539013, 1439068074410754821, 52561141742861529275, 1914657702278841483449, 69604270238190287361304
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Row 5 of A263519.

Examples

			Some solutions for n=2
..0..1..2....0..1..2....0..4..5....0..1..2....0..1..2....0..4..5....0..1..5
..3..7..5....6..3..5....3..1..2....3..4..8....6..3..4....3..1..2....4..3..2
..6..4..8....7..4..8....6..7..8....7..6..5....9..7..5....6.10.11....9..6..7
..9.10.11...10..9.11....9.11.10...10..9.11...10.11..8....9..7..8...12.10..8
.12.16.17...15.12.13...13.12.14...13.12.14...12.14.13...12.14.13...13.14.11
.15.13.14...16.17.14...16.15.17...15.16.17...15.16.17...15.16.17...15.16.17
		

Crossrefs

Cf. A263519.