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!)
A237964 Number of (n+1)X(7+1) 0..2 arrays with the maximum 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 06:41:11

%S 462852,12775098,324579268,10256817488,341724039082,10338290400328,

%T 304213100538740,9354123580841068,293476704649636718,

%U 8960464790968101380,271842574274163847868,8321897976066904815520,257090980241559591679574

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

%C Column 7 of A237965

%H R. H. Hardin, <a href="/A237964/b237964.txt">Table of n, a(n) for n = 1..24</a>

%e Some solutions for n=1

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

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

%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 March 28 10:31 EDT 2024. Contains 371240 sequences. (Running on oeis4.)