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

%I #6 Apr 26 2023 10:02:29

%S 23545,284368,3489965,52177092,785179913,10729163264,144998701422,

%T 2060542176864,29631609284098,413277799902244,5735328595636678,

%U 80682009524531452,1143310236287210246,16019808322936964292

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

%C Column 5 of A237511.

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

%e Some solutions for n=1

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

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

%Y Cf. A237511.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 08 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 July 12 13:44 EDT 2024. Contains 374247 sequences. (Running on oeis4.)