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.

A264053 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having index change +-(.,.) 0,0 1,2 or 2,-2.

Original entry on oeis.org

1, 8, 324, 32400, 12960000, 34260048000, 431336822822500
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Comments

Diagonal of A264059.

Examples

			Some solutions for n=4
..0..1..2.11.12....0..8..9..3..4....0..8.10..3.12....0..1..2.11..4
..5..6.14..8..9....5..6.15..1..2....5..6.14..1..2....5..6.15.16..9
.17..3..4.13.22...17.11.19.13.14...17.11..4.13..7...10..3.19.21..7
..7.23.10.18.19....7.23.10.18.12...22.16..9.18.19...22..8.24.18.12
.20.21.15.16.24...20.21.22.16.24...20.21.15.23.24...20.13.14.23.17
		

Crossrefs

Cf. A264059.