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!)
A184209 Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock sum greater than 6. 1

%I #8 Apr 12 2018 08:49:17

%S 106,1036,9247,85600,782637,7189899,65937529,605100146,5551579376,

%T 50938410285,467368565920,4288240391723,39345646886265,

%U 361006503721815,3312326008509618,30391436683307908,278849163985769031

%N Number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock sum greater than 6.

%C Column 1 of A184217.

%H R. H. Hardin, <a href="/A184209/b184209.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n) = 6*a(n-1) + 35*a(n-2) - 37*a(n-3) - 160*a(n-4) + 36*a(n-5) + 144*a(n-6).

%F Empirical g.f.: x*(106 + 400*x - 679*x^2 - 2220*x^3 + 684*x^4 + 2160*x^5) / (1 - 6*x - 35*x^2 + 37*x^3 + 160*x^4 - 36*x^5 - 144*x^6). - _Colin Barker_, Apr 12 2018

%e Some solutions for 3 X 2:

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

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

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

%Y Cf. A184217.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 10 2011

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)