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!)
A251485 Number of (n+1) X (2+1) 0..3 arrays with no 2 X 2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements. 1

%I #6 Apr 30 2022 21:31:59

%S 3456,186304,10046784,541815424,29219848960,1575813859456,

%T 84982973330688,4583095819732736,247164420634563840,

%U 13329472755050099712,718852832815666617344,38767429496362104931840,2090711090157985348366336

%N Number of (n+1) X (2+1) 0..3 arrays with no 2 X 2 subblock having the sum of its diagonal elements less than the minimum of its antidiagonal elements.

%C Column 2 of A251491.

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

%F Empirical: a(n) = 64*a(n-1) -556*a(n-2) +704*a(n-3) -356*a(n-4) -3968*a(n-5) +36*a(n-6) +1152*a(n-7).

%e Some solutions for n=2

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

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

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

%Y Cf. A251491.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 03 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 25 10:22 EDT 2024. Contains 371967 sequences. (Running on oeis4.)