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

Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one
1

%I #5 Feb 13 2014 06:30:09

%S 256,1764,12328,86736,610052,4293744,30217760,212542304,1495366768,

%T 10525153280,74070550592,520994891136,3665527224832,25799896109056,

%U 181566255460096,1277095009756160,8985167874906624,63242311835283456

%N Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 1 of A237785

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

%F Empirical: a(n) = 2584*a(n-4) -329840*a(n-8) +11009280*a(n-12) -157232128*a(n-16) +824834048*a(n-20) +1067106304*a(n-24) -9353953280*a(n-28) +10336862208*a(n-32) for n>35

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 13 2014

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

Last modified September 19 23:07 EDT 2024. Contains 376015 sequences. (Running on oeis4.)