editing
approved
editing
approved
R. H. Hardin, <a href="/A237494/b237494.txt">Table of n, a(n) for n = 1..60</a>
allocated for R. H. Hardin
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
256, 1728, 1728, 11960, 19288, 11960, 84000, 221512, 221512, 84000, 589944, 2584128, 4248736, 2584128, 589944, 4135648, 30171224, 82919944, 82919944, 30171224, 4135648, 28986208, 351706460, 1621147104, 2719193212, 1621147104
1,1
Table starts
........256.........1728..........11960..........84000..........589944
.......1728........19288.........221512........2584128........30171224
......11960.......221512........4248736.......82919944......1621147104
......84000......2584128.......82919944.....2719193212.....89364382296
.....589944.....30171224.....1621147104....89364382296...4939887793804
....4135648....351706460....31641923080..2932161164292.272584971093496
...28986208...4095080272...616331002428.95933647220152
..203229696..47706224548.12011356925024
.1425235712.556422733920
.9994034688
Empirical for column k:
k=1: [linear recurrence of order 24] for n>27
k=2: [order 80] for n>82
Some solutions for n=2 k=4
..0..1..0..2..0....0..1..2..1..2....0..0..2..1..0....0..2..0..0..0
..1..0..2..2..1....1..1..2..0..1....0..3..3..1..0....3..1..0..2..1
..3..1..1..0..1....2..2..0..2..2....2..1..0..0..2....0..3..2..1..0
allocated
nonn,tabl
R. H. Hardin, Feb 08 2014
approved
editing
allocated for R. H. Hardin
allocated
approved