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!)
A237489 Number of (n+1)X(1+1) 0..3 arrays with the maximum plus the upper median minus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I

%S 256,1728,11960,84000,589944,4135648,28986208,203229696,1425235712,

%T 9994034688,70063673600,491213816320,3444698036992,24155061404672,

%U 169341502948352,1187245857484800,8325697972232192,58381830568157184

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

%C Column 1 of A237494

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

%F Empirical: a(n) = 2568*a(n-4) -371328*a(n-8) +15212544*a(n-12) -125530112*a(n-16) +93167616*a(n-20) -143392768*a(n-24) for n>27

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 08 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 October 5 06:51 EDT 2022. Contains 357252 sequences. (Running on oeis4.)