|
|
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
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|