|
|
A206994
|
|
T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 1 1 vertically
|
|
7
|
|
|
2, 4, 4, 7, 16, 7, 13, 49, 49, 13, 24, 169, 174, 169, 24, 44, 576, 840, 840, 576, 44, 81, 1936, 3858, 6510, 3858, 1936, 81, 149, 6561, 17460, 46878, 46878, 17460, 6561, 149, 274, 22201, 80070, 329952, 516724, 329952, 80070, 22201, 274, 504, 75076, 365784
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
...2.....4......7.......13........24..........44...........81............149
...4....16.....49......169.......576........1936.........6561..........22201
...7....49....174......840......3858.......17460........80070.........365784
..13...169....840.....6510.....46878......329952......2371090.......16939450
..24...576...3858....46878....516724.....5517786.....60684900......661767626
..44..1936..17460...329952...5517786....88819714...1482397764....24487141408
..81..6561..80070..2371090..60684900..1482397764..37849652838...954576893140
.149.22201.365784.16939450.661767626.24487141408.954576893140.36679559167444
|
|
LINKS
|
Shizuo Kaji, A Derouet-Jourdan, H Ochiai, Dappled tiling, arXiv preprint arXiv:1607.06138, 2016
|
|
EXAMPLE
|
Some solutions for n=4 k=3
..1..1..1....1..0..1....1..0..1....1..0..0....1..0..0....1..1..0....1..1..0
..0..0..1....1..0..1....1..0..0....0..0..1....1..0..1....1..0..1....1..1..1
..0..1..0....0..1..0....0..1..1....0..1..0....0..0..1....0..1..1....0..0..1
..1..0..1....0..1..0....0..0..1....0..0..1....1..0..0....1..1..0....1..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|