|
|
A209951
|
|
T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference
|
|
9
|
|
|
34, 258, 258, 1956, 4975, 1956, 14832, 95794, 95794, 14832, 112464, 1845126, 4681176, 1845126, 112464, 852768, 35537484, 228881560, 228881560, 35537484, 852768, 6466176, 684469520, 11189540644, 28414622976, 11189540644, 684469520
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
.......34..........258.............1956...............14832
......258.........4975............95794.............1845126
.....1956........95794..........4681176...........228881560
....14832......1845126........228881560.........28414622976
...112464.....35537484......11189540644.......3526904366260
...852768....684469520.....547050257224.....437792367422004
..6466176..13183187396...26744766723116...54342179402121844
.49030272.253914272972.1307528820052772.6745399989408922240
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=3
..2..0..1..2....1..0..0..0....0..0..2..0....1..2..1..1....0..0..2..1
..2..1..1..1....0..2..2..1....0..2..2..2....1..1..1..0....2..0..1..1
..1..1..2..2....0..0..2..0....1..1..0..2....1..2..1..2....0..0..2..0
..2..2..0..1....0..2..1..2....2..0..2..1....0..2..2..2....2..2..1..1
..0..2..2..1....1..1..1..1....1..2..1..1....2..1..0..1....2..1..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|