|
|
A264943
|
|
Number of nX5 arrays of permutations of 5 copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
|
|
0
|
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..1..2..0..1....0..1..2..1..2....0..1..2..1..2....0..1..0..2..1
..0..2..0..1..2....1..2..1..0..2....2..0..2..0..1....1..2..0..1..0
..1..2..1..0..2....0..2..0..1..0....1..0..2..0..1....2..0..2..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|