|
| |
|
|
A209787
|
|
T(n,k)=Half the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference
|
|
9
|
|
|
|
64, 576, 576, 5074, 12492, 5074, 44948, 266126, 266126, 44948, 397734, 5719838, 13606964, 5719838, 397734, 3520628, 122871278, 706149734, 706149734, 122871278, 3520628, 31161462, 2641341716, 36572974507, 89046135210, 36572974507
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Table starts
........64...........576.............5074................44948
.......576.........12492...........266126..............5719838
......5074........266126.........13606964............706149734
.....44948.......5719838........706149734..........89046135210
....397734.....122871278......36572974507.......11197401806412
...3520628....2641341716....1896474527890.....1410846309824300
..31161462...56780957220...98317767405921...177700386195973368
.275819644.1220714555712.5097617301286476.22387171143190946674
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..144
|
|
|
EXAMPLE
|
Some solutions for n=4 k=3
..2..1..2..3....1..3..3..3....1..0..0..1....0..2..2..1....2..0..2..0
..0..1..2..1....1..3..1..3....1..0..1..1....0..0..1..1....1..0..0..0
..0..1..3..1....3..3..1..1....1..1..1..2....1..0..0..0....2..2..2..1
..2..1..3..1....1..3..2..3....1..2..1..0....1..2..0..3....1..3..2..0
..2..1..1..1....1..1..1..1....3..2..0..0....3..0..0..0....3..3..1..1
|
|
|
CROSSREFS
|
Sequence in context: A100415 A200841 A070054 * A209780 A177757 A208642
Adjacent sequences: A209784 A209785 A209786 * A209788 A209789 A209790
|
|
|
KEYWORD
|
nonn,tabl
|
|
|
AUTHOR
|
R. H. Hardin Mar 13 2012
|
|
|
STATUS
|
approved
|
| |
|
|
