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

%I #4 Feb 13 2014 06:43:48

%S 14369,367726,9679862,256311790,6776019974,178512761384,4719215160352,

%T 124491992110564,3291189351446428,86781113390907628,

%U 2294272449796529692,60504261616217262684,1599566865451349739950,42181079672005552386760

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

%C Column 3 of A237791

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

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 13 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 March 29 09:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)