login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A264066
Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having index change +-(.,.) 0,0 0,1 or 1,2.
0
2, 21, 1210, 239580, 242621698, 1084282319384, 23180312098708413, 2169349966829797899136
OFFSET
1,1
COMMENTS
Diagonal of A264071.
EXAMPLE
Some solutions for n=3
..6..1..7..3....5..1..7..3....6..1..7..3....0..1..2..3....0..6..2..3
.10.11..0..2....9.11..0..2....4..5..0..2...10..5..6..7....4.11..1..7
..8..9..4..5....8.15..4..6...14.15.10.11...13..4.15.11....8.14.15..5
.12.13.14.15...12.13.14.10...12.13..8..9...12..8.14..9...12.13..9.10
CROSSREFS
Cf. A264071.
Sequence in context: A019994 A015193 A022488 * A052157 A050204 A368188
KEYWORD
nonn
AUTHOR
R. H. Hardin, Nov 02 2015
STATUS
approved