|
|
A209178
|
|
T(n,k)=Number of nXk 0..3 arrays with every element value z a city block distance of exactly z from another element value z
|
|
6
|
|
|
1, 2, 2, 5, 13, 5, 12, 115, 115, 12, 28, 1243, 5053, 1243, 28, 65, 11598, 236727, 236727, 11598, 65, 158, 110995, 9263488, 43361446, 9263488, 110995, 158, 382, 1053489, 343130181, 6170585599, 6170585599, 343130181, 1053489, 382, 905, 9540747
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Table starts
...1.......2...........5...........12............28...........65
...2......13.........115.........1243.........11598.......110995
...5.....115........5053.......236727.......9263488....343130181
..12....1243......236727.....43361446....6170585599.815113744488
..28...11598.....9263488...6170585599.3100658437275
..65..110995...343130181.815113744488
.158.1053489.12206184150
.382.9540747
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..49
|
|
EXAMPLE
|
Some solutions for n=6 k=2
..3..0....1..0....1..1....1..1....2..3....0..2....1..1....1..1....2..2....3..0
..0..1....1..1....2..0....1..2....2..2....1..1....2..0....0..1....2..3....1..1
..0..1....0..3....2..1....2..0....3..2....3..2....3..2....2..3....2..2....3..3
..3..1....1..1....2..1....2..1....0..3....0..2....0..0....0..2....2..2....0..2
..0..2....3..1....2..1....0..1....1..1....2..3....1..3....3..0....2..3....0..3
..2..0....0..3....0..0....2..1....3..0....1..1....1..1....0..0....2..2....3..2
|
|
CROSSREFS
|
Sequence in context: A095339 A216025 A209476 * A209720 A208960 A209054
Adjacent sequences: A209175 A209176 A209177 * A209179 A209180 A209181
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
R. H. Hardin Mar 05 2012
|
|
STATUS
|
approved
|
|
|
|