|
| |
|
|
A205954
|
|
T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors or the same number of counterclockwise edge increases as its vertical neighbors.
|
|
7
|
|
|
|
256, 2120, 2120, 17920, 25512, 17920, 151824, 310912, 310912, 151824, 1285076, 3825072, 5550256, 3825072, 1285076, 10876432, 47118720, 101702648, 101702648, 47118720, 10876432, 92062852, 583496376, 1912957100, 2938041784, 1912957100
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Table starts
.......256........2120..........17920.........151824.........1285076
......2120.......25512.........310912........3825072........47118720
.....17920......310912........5550256......101702648......1912957100
....151824.....3825072......101702648.....2938041784.....90234357280
...1285076....47118720.....1912957100....90234357280...4762415402596
..10876432...583496376....36783376600..2915195222352.273204243466080
..92062852..7243545064...718097911212.97376756715048
.779221408.90103381160.14168783055608
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..59
|
|
|
EXAMPLE
|
Some solutions for n=4, k=3:
..3..2..2..3....0..1..0..0....1..2..1..2....1..0..0..0....2..2..1..1
..1..1..3..3....0..2..0..0....3..0..1..3....0..3..3..2....2..2..0..2
..1..2..1..2....0..1..1..2....0..0..2..3....3..3..3..0....3..1..0..1
..2..3..0..0....2..1..1..0....0..0..1..3....1..2..0..0....2..2..2..1
..0..3..0..0....3..3..2..3....0..2..1..2....1..1..2..3....2..2..3..2
|
|
|
CROSSREFS
|
Column 1 is A205459.
Sequence in context: A014711 A236451 A236445 * A205466 A205459 A237076
Adjacent sequences: A205951 A205952 A205953 * A205955 A205956 A205957
|
|
|
KEYWORD
|
nonn,tabl
|
|
|
AUTHOR
|
R. H. Hardin, Feb 02 2012
|
|
|
STATUS
|
approved
|
| |
|
|
