|
|
A265878
|
|
T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical and antidiagonal neighbors less than itself.
|
|
5
|
|
|
1, 3, 3, 5, 25, 5, 11, 137, 137, 11, 26, 2084, 1330, 2084, 26, 55, 14854, 30363, 30363, 14854, 55, 119, 136969, 544092, 4393458, 544092, 136969, 119, 263, 1288011, 9831410, 344222538, 344222538, 9831410, 1288011, 263, 573, 10892624, 185555660
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Table starts
...1.......3.........5............11...............26...................55
...3......25.......137..........2084............14854...............136969
...5.....137......1330.........30363...........544092..............9831410
..11....2084.....30363.......4393458........344222538..........26635427570
..26...14854....544092.....344222538......90246574543.......21163068638346
..55..136969...9831410...26635427570...21163068638346....15698042741229661
.119.1288011.185555660.2364713952883.6441486693916691.16536262399332183012
|
|
LINKS
|
|
|
FORMULA
|
Empirical for column k:
k=1: a(n) = a(n-1) +a(n-2) +3*a(n-3) +a(n-4)
k=2: [order 41]
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..0..1..2..0....0..0..1..2....2..1..4..1....1..4..3..0....0..3..3..2
..3..5..5..0....0..5..6..0....1..0..0..3....0..1..2..2....0..1..1..1
..0..0..0..0....0..0..3..1....1..3..4..0....2..3..3..0....1..1..0..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|