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

%I #5 Mar 31 2012 12:36:06

%S 361,24414,431016,12048996,270129432,6869877312,162868019530,

%T 4042781079474,97568985207226,2401857269073876,58373470048298950,

%U 1431967704538476946,34909706847661265062,854981421174931771662

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

%C Column 3 of A186871

%H R. H. Hardin, <a href="/A186869/b186869.txt">Table of n, a(n) for n = 1..39</a>

%e Some solutions for 3X4

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 27 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 2 14:48 EST 2024. Contains 370493 sequences. (Running on oeis4.)