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!)
A238173 Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the minimum of every 2 X 2 subblock equal. 1

%I #7 Oct 24 2018 08:21:40

%S 81,423,2329,13447,79641,479703,2918233,17859079,109676409,674920407,

%T 4158200569,25636328263,158116883673,975438912855,6018376002073,

%U 37135707651847,229151775103929,1414053340986711,8725990453989049

%N Number of (n+1) X (1+1) 0..2 arrays with the maximum plus the minimum of every 2 X 2 subblock equal.

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

%F Empirical: a(n) = 10*a(n-1) - 22*a(n-2) - 20*a(n-3) + 63*a(n-4) - 6*a(n-5) - 24*a(n-6).

%F Empirical g.f.: x*(81 - 387*x - 119*x^2 + 1083*x^3 - 234*x^4 - 456*x^5) / ((1 - x)*(1 - 3*x - 2*x^2)*(1 - 6*x - 3*x^2 + 12*x^3)). - _Colin Barker_, Oct 24 2018

%e Some solutions for n=5:

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

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

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

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

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

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

%Y Column 1 of A238180.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 19 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 September 11 05:49 EDT 2024. Contains 375814 sequences. (Running on oeis4.)