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.

A263512 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 filled by rows with each element moved a city block distance of 0 or 1.

Original entry on oeis.org

3, 35, 2076, 489294, 529329240, 2543460828164, 55588636099730695, 5525569263450576586033
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Diagonal of A263519.

Examples

			Some solutions for n=3
..0..1..3..7....0..1..6..7....0..1..6..7....0..1..2..3....0..1..3..7
..8..4..2..6....5..4..2..3....4..5..2..3....4..6..5..7....4..5..2..6
.12..5.11.10....8.13.14.10....8..9.10.11....9..8.11.10....9..8.11.10
.13..9.14.15...12..9.15.11...12.13.14.15...13.12.15.14...13.12.14.15
		

Crossrefs

Cf. A263519.