login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185639 Number of (n+1)X4 0..3 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum 1

%I

%S 854,56558,1009472,25812774,574149820,13489115938,310180543438,

%T 7192778764436,166258478732636,3848046425438352,89017376857316370,

%U 2059684454098786874,47652910375827853446,1102538007301891708286

%N Number of (n+1)X4 0..3 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum

%C Column 3 of A185640

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

%e Some solutions for 3X4

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 01 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 04:58 EDT 2021. Contains 347577 sequences. (Running on oeis4.)