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

%I

%S 87164,1260486,18401364,330330878,6045609040,101410470742,

%T 1668740442760,28739211200900,500884807969628,8543128692901112,

%U 144626632332405084,2476006354146555628,42573962725861207468,727911488082492382520

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

%C Column 6 of A237412.

%H R. H. Hardin, <a href="/A237410/b237410.txt">Table of n, a(n) for n = 1..82</a>

%e Some solutions for n=1

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 07 2014

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 June 22 21:29 EDT 2021. Contains 345393 sequences. (Running on oeis4.)