|
|
A264265
|
|
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,0 or 1,2.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..6..1..2..7....4..1..2..7....0..7..2..3....4..1..2..3....4..1..6..3
..8.11..0..3....0.11.10..3....4..9.10..1....0..5..6.11....0..9..2..7
..4..9.10..5...12.13..6..5....8.15..6..5...12.13.10..7...12..5.14.11
.12.13.14.15....8..9.14.15...12.13.14.11....8..9.14.15....8.13.10.15
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|