login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237933 Number of (n+1)X(3+1) 0..3 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one 1

%I #4 Feb 16 2014 05:47:21

%S 11701,228866,4554824,94068938,1903243716,38477471800,782578367787,

%T 16010421948796,325182956026994,6598288132312864,134297532801921910,

%U 2737952835801723408,55665392270619900732,1131238334494469739760

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

%C Column 3 of A237936

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 16 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 December 10 19:44 EST 2023. Contains 367717 sequences. (Running on oeis4.)