|
| |
|
|
A206054
|
|
T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one
|
|
9
|
|
|
|
48, 255, 255, 1338, 2310, 1338, 7041, 20400, 20400, 7041, 37020, 180195, 295392, 180195, 37020, 194691, 1590378, 4256868, 4256868, 1590378, 194691, 1023822, 14037225, 61165512, 99399924, 61165512, 14037225, 1023822, 5384085, 123893883
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Table starts
......48........255.........1338...........7041............37020
.....255.......2310........20400.........180195..........1590378
....1338......20400.......295392........4256868.........61165512
....7041.....180195......4256868.......99399924.......2308027074
...37020....1590378.....61165512.....2308027074......86276125692
..194691...14037225....878480541....53518920690....3216834301377
.1023822..123893883..12614174310..1240395191991..119812800012048
.5384085.1093502865.181122252378.28744156779339.4461032943350559
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..220
|
|
|
EXAMPLE
|
Some solutions for n=4 k=3
..1..0..0..2....1..0..1..1....0..2..0..0....1..0..1..2....0..1..1..2
..0..0..1..1....2..0..1..2....2..2..2..2....0..0..1..2....1..1..2..2
..1..1..1..0....2..0..1..1....1..1..1..2....0..1..1..1....2..2..2..1
..1..0..0..0....2..0..1..2....0..1..2..2....0..0..1..0....0..0..0..0
..2..0..1..2....2..0..1..2....1..1..1..1....0..1..1..1....1..2..2..0
|
|
|
CROSSREFS
|
Sequence in context: A157913 A181773 A052683 * A206047 A223434 A235911
Adjacent sequences: A206051 A206052 A206053 * A206055 A206056 A206057
|
|
|
KEYWORD
|
nonn,tabl
|
|
|
AUTHOR
|
R. H. Hardin Feb 03 2012
|
|
|
STATUS
|
approved
|
| |
|
|
