The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A251381 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 5 6 or 7 8

%I #4 Dec 01 2014 21:52:09

%S 124,1048,1048,9124,19644,9124,80296,385704,385704,80296,709396,

%T 7712232,17309672,7712232,709396,6276040,155378004,796635224,

%U 796635224,155378004,6276040,55551652,3140670344,37078015004,84953563232,37078015004

%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to 5 6 or 7

%C Table starts

%C ......124........1048...........9124..............80296................709396

%C .....1048.......19644.........385704............7712232.............155378004

%C .....9124......385704.......17309672..........796635224...........37078015004

%C ....80296.....7712232......796635224........84953563232.........9193424418268

%C ...709396...155378004....37078015004......9193424418268......2320685899177020

%C ..6276040..3140670344..1734708707700...1001823357589516....590881254434212576

%C .55551652.63575161960.81356563852940.109536506378241540.151084764887689962372

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

%F Empirical for column k:

%F k=1: a(n) = 10*a(n-1) -3*a(n-2) -66*a(n-3) +24*a(n-4)

%F k=2: [order 12]

%F k=3: [order 52]

%e Some solutions for n=2 k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Dec 01 2014

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

Last modified June 4 12:12 EDT 2023. Contains 363128 sequences. (Running on oeis4.)