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.

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

53, 2651, 158109, 9051857, 529329240, 30867389241, 1805523575884, 105637731091773, 6184312882582853, 362113871416827745, 21206150373034322027, 1241958953411618737140, 72739454531341002993626
Offset: 1

Views

Author

R. H. Hardin, Oct 19 2015

Keywords

Comments

Column 5 of A263519.

Examples

			Some solutions for n=3
..0..1..2..3..4..5....0..2..8..9.10.11....0..1..2..4.10.11....0..1..2..3..4..5
..6.13..8.10..9.11....6..1..7..3..4..5....6.13..7..3..9..5....6.13..8..9.10.17
.12..7.14.15.16.23...12.13.14.16.15.23...12.19..8.15.16.17...12..7.14.21.15.11
.18.20.19.22.21.17...18.19.20.22.21.17...18.20.14.21.23.22...19.18.20.22.16.23
		

Crossrefs

Cf. A263519.