login

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

Number of (n+1)X(1+1) 0..3 arrays colored with the maximum plus the upper median of every 2X2 subblock
1

%I #5 Jan 29 2014 07:20:47

%S 256,2596,25950,256376,2525698,24922062,246386369,2433171504,

%T 24010605844,237040427808,2341100151528,23116276195064,

%U 228210652127196,2253179860569112,22248307411651820,219673641163137064

%N Number of (n+1)X(1+1) 0..3 arrays colored with the maximum plus the upper median of every 2X2 subblock

%C Column 1 of A236601

%H R. H. Hardin, <a href="/A236597/b236597.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 224*a(n-3) +4264*a(n-4) +18336*a(n-5) +94100*a(n-6) +288576*a(n-7) -458324*a(n-8) -2955288*a(n-9) -9895792*a(n-10) -31179344*a(n-11) -22508592*a(n-12) +8785408*a(n-13) +23968768*a(n-14) +101248896*a(n-15) +87015168*a(n-16) -13844480*a(n-17) -14419968*a(n-18) -26182656*a(n-19) -23973888*a(n-20) for n>22

%e Some solutions for n=3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 29 2014