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.

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

93, 10350, 1317780, 162207955, 20339400914, 2543460828164, 319022980139204, 40028581755172441, 5025951440933512579, 631220496156096648485, 79292571943138559531790, 9961616809463166444531295
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Column 6 of A263519.

Examples

			Some solutions for n=2
..0..1..2..3..4..5..6....0..1..2..3..4.12.13....0..1..2..3..4..5.13
..7..8.10.11.18.13.20...14..7.16.11.10..5..6....7.15..8.11.18.12..6
.15.14..9.16.17.12.19...15..8..9.17.18.19.20...14.16..9.10.17.19.20
		

Crossrefs

Cf. A263519.