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

%I #8 Oct 20 2018 06:04:56

%S 260,2618,26408,267548,2707568,27447272,278028320,2818432496,

%T 28558894016,289486933664,2933725360256,29736111094208,

%U 301369493643008,3054575081277056,30958314481459712,313777505508028160

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

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

%F Empirical: a(n) = 8*a(n-1) + 58*a(n-2) - 368*a(n-3) - 24*a(n-4) + 192*a(n-5).

%F Empirical g.f.: 2*x*(130 + 269*x - 4808*x^2 + 60*x^3 + 2592*x^4) / (1 - 8*x - 58*x^2 + 368*x^3 + 24*x^4 - 192*x^5). - _Colin Barker_, Oct 20 2018

%e Some solutions for n=3:

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

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

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

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

%Y Column 2 of A235911.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 16 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 February 23 04:31 EST 2024. Contains 370267 sequences. (Running on oeis4.)