|
| |
|
|
A206137
|
|
T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.
|
|
9
|
|
|
|
256, 564, 564, 3092, 6668, 3092, 19660, 91924, 91924, 19660, 125236, 1269044, 2761756, 1269044, 125236, 797996, 17521788, 83120732, 83120732, 17521788, 797996, 5085012, 241927532, 2502596196, 5465582068, 2502596196, 241927532
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Table starts:
......256.........564...........3092..............19660................125236
......564........6668..........91924............1269044..............17521788
.....3092.......91924........2761756...........83120732............2502596196
....19660.....1269044.......83120732.........5465582068..........359793857820
...125236....17521788.....2502596196.......359793857820........51845281856116
...797996...241927532....75353928196.....23692759265020......7476894104333060
..5085012..3340355572..2268967605164...1560344155530612...1078605317680077404
.32403084.46121153588.68320694237116.102763262525972772.155614824084934672796
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..144
|
|
|
EXAMPLE
|
Some solutions for n=4, k=3:
..3..0..1..0....2..1..2..3....0..1..3..2....0..1..3..0....0..1..2..3
..0..3..0..3....3..2..0..1....1..2..0..3....1..2..0..1....2..0..1..2
..1..0..2..0....0..3..1..3....3..0..1..0....2..3..1..2....0..2..3..0
..2..1..0..1....3..2..0..1....2..3..0..2....0..1..2..0....1..0..1..3
..3..2..1..2....1..3..1..0....3..2..3..0....1..2..0..1....0..3..0..2
|
|
|
CROSSREFS
|
Sequence in context: A294153 A235060 A260243 * A206130 A110297 A134608
Adjacent sequences: A206134 A206135 A206136 * A206138 A206139 A206140
|
|
|
KEYWORD
|
nonn,tabl
|
|
|
AUTHOR
|
R. H. Hardin, Feb 04 2012
|
|
|
STATUS
|
approved
|
| |
|
|
