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

%I #5 Aug 11 2014 22:46:08

%S 2960,41608,587908,8623452,130105204,2020106076,32207456576,

%T 526051660468,8776747793696,149126416376292,2572768815952496,

%U 44945537009056724,793178747691319552,14111447386534908836,252672813228732519144

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

%C Column 3 of A236009

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

%H R. H. Hardin, <a href="/A236005/a236005.txt">Empirical recurrence of order 70</a>

%F Empirical recurrence of order 70 (see link above)

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 18 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 19 08:36 EDT 2024. Contains 371782 sequences. (Running on oeis4.)