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

%I #5 Feb 15 2014 13:54:19

%S 256,1780,12552,88544,635200,4438816,31507328,221652256,1584432064,

%T 11094868672,78930109696,554462140416,3957466858304,27739531863040,

%U 197546198927360,1386754238612992,9890947053918976,69362350056729600

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

%C Column 1 of A237911

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

%F Empirical: a(n) = 1884*a(n-4) +28048*a(n-6) +134800*a(n-8) +241600*a(n-10) +86848*a(n-12) -80384*a(n-14) +25600*a(n-16) for n>17

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 15 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 June 24 21:56 EDT 2024. Contains 373690 sequences. (Running on oeis4.)