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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A236505 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock 5

%I #4 Jan 27 2014 05:04:28

%S 256,2632,2632,27458,54110,27458,284408,1116232,1116232,284408,

%T 2954930,23079872,46503900,23079872,2954930,30642966,477377520,

%U 1936913190,1936913190,477377520,30642966,318132117,9873995570,81160939773

%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays colored with the maximum plus the minimum minus the lower median of every 2X2 subblock

%C Table starts

%C ........256.........2632.........27458.........284408........2954930

%C .......2632........54110.......1116232.......23079872......477377520

%C ......27458......1116232......46503900.....1936913190....81160939773

%C .....284408.....23079872....1936913190...164671652250.14038040966310

%C ....2954930....477377520...81160939773.14038040966310

%C ...30642966...9873995570.3386470375460

%C ..318132117.204198122306

%C .3300684904

%H R. H. Hardin, <a href="/A236505/b236505.txt">Table of n, a(n) for n = 1..40</a>

%F Empirical for column k:

%F k=1: [linear recurrence of order 34]

%e Some solutions for n=2 k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Jan 27 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 3 07:27 EDT 2024. Contains 375649 sequences. (Running on oeis4.)