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!)
A237411 Number of (n+1) X (7+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 #7 Feb 07 2014 19:35:25

%S 354008,6627450,125750824,3029315052,74740595664,1668740442760,

%T 36546653191142,842126502478880,19674093304667730,447934704016463420,

%U 10135886871027538506,232015073246807414804,5340726310335786917066

%N Number of (n+1) X (7+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 7 of A237412.

%H R. H. Hardin, <a href="/A237411/b237411.txt">Table of n, a(n) for n = 1..25</a>

%e Some solutions for n=1

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

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

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)