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.

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

66, 1198, 25968, 489294, 9051857, 162207955, 2861438066, 49842444849, 860844781350, 14774845188752, 252437172412114, 4298676558542165, 73021464693301088, 1238164128738016241, 20966325620945097786
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Row 4 of A263519.

Examples

			Some solutions for n=3
..0..1..2..7....0..2..6..7....0..1..2..3....0..5..6..7....0..5..6..7
..4..6..5..3....4..1.10..3....5..4..7..6....4..1..2..3....4..1..2..3
..9..8.10.11....8..5..9.11....8.13..9.11....9..8.11.10....9..8.11.10
.13.12.15.14...13.12.14.15...12.17.10.14...13.12.14.19...13.12.14.15
.17.16.18.19...17.16.19.18...16.18.19.15...16.17.18.15...16.18.17.19
		

Crossrefs

Cf. A263519.

Formula

Empirical recurrence of order 92 (see link above)