login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233818 T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1)) 8

%I

%S 96,428,428,1824,2216,1824,8136,10972,10972,8136,34848,59164,61896,

%T 59164,34848,155488,301132,403108,403108,301132,155488,667200,1671748,

%U 2384304,3261172,2384304,1671748,667200,2977440,8669484,16476460,23737972

%N T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 11 (11 maximizes T(1,1))

%C Table starts

%C .......96........428........1824..........8136..........34848.........155488

%C ......428.......2216.......10972.........59164.........301132........1671748

%C .....1824......10972.......61896........403108........2384304.......16476460

%C .....8136......59164......403108.......3261172.......23737972......208935048

%C ....34848.....301132.....2384304......23737972......203778336.....2269466400

%C ...155488....1671748....16476460.....208935048.....2269466400....32723763904

%C ...667200....8669484...100402408....1586833704....20442834720...376273555864

%C ..2977440...49193332...727727388...15004751648...252044188760..6112734012140

%C .12787200..258472076..4526565112..117407564852..2344074621648.72958370707804

%C .57068480.1489731188.34009964384.1174169462004.31455090410644

%H R. H. Hardin, <a href="/A233818/b233818.txt">Table of n, a(n) for n = 1..112</a>

%F Empirical for column k:

%F k=1: a(n) = 30*a(n-2) -220*a(n-4) +240*a(n-6)

%F k=2: [order 18]

%F k=3: [order 78]

%e Some solutions for n=3 k=4

%e ..0..0..2..2..3....3..1..0..1..0....3..1..3..5..5....0..1..0..2..2

%e ..2..1..0..1..3....1..2..0..2..2....3..2..3..4..3....2..0..2..1..0

%e ..0..2..0..2..3....0..2..1..0..1....2..4..2..2..2....0..1..0..2..2

%e ..2..1..2..1..1....1..0..2..2..0....2..3..4..3..4....0..2..0..1..0

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Dec 16 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 09:25 EST 2019. Contains 329791 sequences. (Running on oeis4.)