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.

A264013 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, 5, 169, 20570, 9150625, 21860843125, 252579343635025, 12379056073433237760
Offset: 1

Views

Author

R. H. Hardin, Nov 01 2015

Keywords

Comments

Diagonal of A264017.

Examples

			Some solutions for n=4
..7..1.14..3..4....0..8.14..3..4....0..1..2..3..4...12..8.14..3..4
.12.13..0..8..9...17..6..7..1..9...12..6.19..8..9....5.18..0..1..9
.10.11.24..6..2...22.23.12.13..2...10.18.24.13.14...22.11.19.13..2
.15.23..5.18.19...15.16..5.18.19...15.23..5.11..7...15.23.17..6..7
.20.21.22.16.17...20.21.10.11.24...20.21.22.16.17...20.21.10.16.24
		

Crossrefs

Cf. A264017.