|
|
A199256
|
|
T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and no element equal to any horizontal or vertical neighbor
|
|
8
|
|
|
1, 1, 1, 1, 1, 1, 1, 14, 14, 1, 6, 21, 114, 21, 6, 21, 424, 447, 447, 424, 21, 41, 571, 16898, 11223, 16898, 571, 41, 36, 14160, 311216, 305863, 305863, 311216, 14160, 36, 281, 18157, 2913528, 8862785, 68639138, 8862785, 2913528, 18157, 281, 1051, 508802
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
Table starts
....1......1...........1............1.............6..............21
....1......1..........14...........21...........424.............571
....1.....14.........114..........447.........16898..........311216
....1.....21.........447........11223........305863.........8862785
....6....424.......16898.......305863......68639138......6888550898
...21....571......311216......8862785....6888550898....208100267703
...41..14160.....2913528....267827143..340245592285.186725016600685
...36..18157....11312517...8351549833.6769314291049
..281.508802...551973865.266729329121
.1051.635901.11307744507
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..84
|
|
EXAMPLE
|
Some solutions for n=6 k=4
..0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1
..1..0..2..3....1..0..2..0....1..2..1..2....1..2..1..3....1..2..1..2
..3..2..1..2....3..2..3..2....0..3..2..3....3..0..3..2....2..3..2..3
..2..0..3..0....2..3..1..3....2..1..3..0....2..3..2..3....0..2..0..2
..3..2..1..3....3..2..3..0....0..3..0..3....0..2..3..1....3..0..3..1
..2..1..3..0....1..0..1..2....1..2..3..2....1..0..2..0....1..3..0..3
|
|
CROSSREFS
|
Column 1 is A199194
Sequence in context: A206564 A076158 A174160 * A199201 A128883 A010853
Adjacent sequences: A199253 A199254 A199255 * A199257 A199258 A199259
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
R. H. Hardin Nov 04 2011
|
|
STATUS
|
approved
|
|
|
|