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

%I #4 Feb 02 2014 07:17:41

%S 32400,699840,14963200,363916800,8552563200,192222720000,

%T 4279521280000,109212364800000,2683631554560000,62224920576000000,

%U 1432701927424000000,37708128681984000000,957363336806400000000,22733582315028480000000

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

%C Column 5 of A236997

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

%F Empirical: a(n) = 1115200*a(n-4) -430632960000*a(n-8) +66962587648000000*a(n-12) -3428940827852800000000*a(n-16)

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 02 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 April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)