A233892 T(n,k)=Number of (n+1)X(k+1) 0..6 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 30 (30 maximizes T(1,1)), and no two adjacent values equal

112, 384, 384, 1264, 1960, 1264, 4292, 9376, 9376, 4292, 14272, 47732, 65280, 47732, 14272, 48300, 233468, 496200, 496200, 233468, 48300, 161168, 1183328, 3580624, 5859504, 3580624, 1183328, 161168, 544460, 5829956, 27131156, 64285728

Offset

1,1

Comments

Table starts

.....112.......384........1264..........4292..........14272.............48300

.....384......1960........9376.........47732.........233468...........1183328

....1264......9376.......65280........496200........3580624..........27131156

....4292.....47732......496200.......5859504.......64285728.........759799284

...14272....233468.....3580624......64285728.....1057449360.......19042134996

...48300...1183328....27131156.....759799284....19042134996......537828679688

..161168...5829956...197246776....8442821772...317752132336....13755592501748

..544460..29477912..1489635452...99513692668..5699659660192...387390404847976

.1820160.145866316.10865513648.1113177722808.95672524656808.10003460641597548

Links

R. H. Hardin, Table of n, a(n) for n = 1..180

Formula

Empirical for column k:

k=1: [linear recurrence of order 10]

k=2: [order 32]

k=3: [order 58]

Example

Some solutions for n=3 k=4
..6..5..2..5..6....2..5..2..5..6....1..5..4..1..4....1..5..1..2..5
..3..1..0..1..3....0..1..3..1..4....0..2..6..2..0....0..3..4..6..4
..2..5..3..5..6....3..5..6..2..0....4..1..3..1..4....1..5..1..5..1
..0..1..4..1..4....4..1..4..5..1....6..2..6..5..6....0..2..3..2..0

Crossrefs

Sequence in context: A211444 A270759 A352585 * A233885 A235319 A203923

Adjacent sequences: A233889 A233890 A233891 * A233893 A233894 A233895

Keyword

nonn,tabl

Author

R. H. Hardin, Dec 17 2013

Status

approved