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!)
A237900 Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I #4 Feb 15 2014 13:36:09

%S 1768,21410,265306,3351086,42195634,529992314,6659762642,83778337524,

%T 1053822365410,13250382610758,166607568124526,2095232432433472,

%U 26349301348673676,331342826243559342,4166639480874835776

%N Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the upper median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one

%C Column 2 of A237904

%H R. H. Hardin, <a href="/A237900/b237900.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 15 2014

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 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)