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!)
A188368 Number of (n+1)X3 0..3 arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums 1

%I #6 Mar 31 2012 12:36:12

%S 704,15776,315520,6781400,146491208,3204417424,70324529528,

%T 1550290704312,34247741174176,758246919492968,16810324686733992,

%U 373161215486655440,8291015786317391720,184361263940488110328,4102028210533831306896

%N Number of (n+1)X3 0..3 arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums

%C Column 2 of A188370

%H R. H. Hardin, <a href="/A188368/b188368.txt">Table of n, a(n) for n = 1..54</a>

%e Some solutions for 4X3

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 29 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 23 10:13 EDT 2024. Contains 371905 sequences. (Running on oeis4.)