The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A250510 T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with nondecreasing maximum minus minimum of every three consecutive values in every row and column 3

%I

%S 19683,274625,274625,3442951,7615233,3442951,37595375,184021141,

%T 184021141,37595375,371694959,3726466325,8338442435,3726466325,

%U 371694959,3436115229,66217800903,305746039533,305746039533,66217800903,3436115229

%N T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with nondecreasing maximum minus minimum of every three consecutive values in every row and column

%C Table starts

%C .......19683........274625.......3442951.......37595375.....371694959

%C ......274625.......7615233.....184021141.....3726466325...66217800903

%C .....3442951.....184021141....8338442435...305746039533.9532770826509

%C ....37595375....3726466325..305746039533.19678577675635

%C ...371694959...66217800903.9532770826509

%C ..3436115229.1079694968285

%C .30283802613

%H R. H. Hardin, <a href="/A250510/b250510.txt">Table of n, a(n) for n = 1..31</a>

%e Some solutions for n=1 k=4

%e ..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Nov 24 2014

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.

Last modified November 29 03:58 EST 2021. Contains 349416 sequences. (Running on oeis4.)