|
|
A205659
|
|
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.
|
|
14
|
|
|
256, 1976, 2120, 15616, 12296, 17920, 124048, 95008, 75108, 151824, 986388, 839872, 511632, 489984, 1285076, 7854572, 7919128, 5016144, 3227968, 3323532, 10876432, 62623348, 76028256, 57716364, 41013960, 21711080, 23019504, 92062852
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
.......256.......1976......15616.......124048.........986388.........7854572
......2120......12296......95008.......839872........7919128........76028256
.....17920......75108.....511632......5016144.......57716364.......711793356
....151824.....489984....3227968.....41013960......639426584.....10795687000
...1285076....3323532...21711080....353779964.....7578064080....183567605276
..10876432...23019504..142040528...3024213232....88431310744...2994560119488
..92062852..162377816..939384668..26605030292..1092079388028..54588666013136
.779221408.1156073240.6315887616.240164548160.13465529402424.946322990916328
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4, k=3:
..2..3..3..2....1..2..0..2....0..2..3..2....0..2..1..3....0..0..2..3
..3..1..0..3....1..2..0..1....1..0..1..3....0..2..1..2....1..0..2..3
..3..3..3..3....0..1..2..1....1..1..1..1....1..0..3..2....3..1..3..0
..3..3..3..3....2..1..3..2....1..1..1..1....0..0..0..0....3..1..3..0
..0..0..0..2....3..1..2..2....2..0..1..2....1..2..3..3....2..3..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|