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!)
A235927 Number of (n+1) X (2+1) 0..3 arrays with the minimum plus the maximum unequal to the lower median plus the upper median in every 2 X 2 subblock. 1

%I #6 Mar 15 2023 11:41:03

%S 1788,51736,1490648,43061840,1242490716,35871300604,1035323302960,

%T 29885966087744,862635390679796,24900210870914920,718738345158303008,

%U 20746394342769170080,598842214994663070416,17285550535483405614604

%N Number of (n+1) X (2+1) 0..3 arrays with the minimum plus the maximum unequal to the lower median plus the upper median in every 2 X 2 subblock.

%C Column 2 of A235932.

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

%F Empirical: a(n) = 21*a(n-1) +444*a(n-2) -5573*a(n-3) -36510*a(n-4) +496805*a(n-5) -93227*a(n-6) -14098434*a(n-7) +55433514*a(n-8) -50052020*a(n-9) -120521304*a(n-10) +254545856*a(n-11) -50148800*a(n-12) -128903168*a(n-13) +19290112*a(n-14) +13308416*a(n-15) -415744*a(n-16) -258048*a(n-17).

%e Some solutions for n=2

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

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

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

%Y Cf. A235932.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 17 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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)