login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally, vertically or nw-to-se diagonally
9

%I #5 Mar 31 2012 12:37:01

%S 4293,47883,47883,719125,347247,719125,6579664,3588983,3588983,

%T 6579664,70193731,45603178,18913491,45603178,70193731,852798050,

%U 518498299,316877238,316877238,518498299,852798050,8916413698,5787193185

%N T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock having three strictly increasing elements in a row horizontally, vertically or nw-to-se diagonally

%C Table starts

%C ........4293........47883........719125........6579664........70193731

%C .......47883.......347247.......3588983.......45603178.......518498299

%C ......719125......3588983......18913491......316877238......3226550173

%C .....6579664.....45603178.....316877238.....2085204465.....23029550325

%C ....70193731....518498299....3226550173....23029550325....218058070601

%C ...852798050...5787193185...30090522927...415155518470...2236958307511

%C ..8916413698..70339685822..390091281543..3295136296152..24512116048486

%C .96129489898.814228386252.3739587364093.32134688161335.287545807301142

%H R. H. Hardin, <a href="/A204408/b204408.txt">Table of n, a(n) for n = 1..391</a>

%e Some solutions for n=3 k=3

%e ..2..1..0..2..1....1..0..0..1..0....1..1..0..1..2....0..0..2..1..1

%e ..2..2..1..1..0....2..2..1..0..0....2..2..1..1..0....1..1..0..1..2

%e ..0..1..2..2..1....0..0..2..1..1....0..1..2..2..1....1..2..1..2..0

%e ..0..0..1..2..2....0..1..2..2..0....2..0..1..2..2....0..1..2..0..1

%e ..0..0..0..1..2....0..2..0..1..2....1..1..0..1..2....1..0..1..2..2

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Jan 15 2012