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!)
A183485 Number of n X 2 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors. 1

%I #9 Mar 29 2018 08:48:51

%S 4,28,88,400,1936,8368,38272,176320,800512,3661312,16761088,76588288,

%T 350288896,1602288640,7327467520,33513336832,153280811008,

%U 701043896320,3206335627264,14664712241152,67071268225024,306761100427264

%N Number of n X 2 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.

%C Column 2 of A183492.

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

%F Empirical: a(n) = 4*a(n-1) + 24*a(n-3) - 48*a(n-4) - 144*a(n-6).

%F Empirical g.f.: 4*x*(1 + 3*x - 6*x^2 - 12*x^3 - 36*x^4 - 36*x^5) / ((1 - 12*x^3)*(1 - 4*x - 12*x^3)). - _Colin Barker_, Mar 29 2018

%e Some solutions for 3 X 2.

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

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

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

%Y Cf. A183492.

%K nonn

%O 1,1

%A _R. H. Hardin_, Jan 05 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 April 16 12:05 EDT 2024. Contains 371711 sequences. (Running on oeis4.)