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!)
A237676 Number of (n+1) X (5+1) 0..3 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 #6 Mar 10 2022 20:57:22

%S 412120,13569422,482106388,20221334140,818214906406,31933527869372,

%T 1258447301688012,50728902329436816,2031226107205290712,

%U 80510055858990315756,3200557123206480154254,127914709575314288040444

%N Number of (n+1) X (5+1) 0..3 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 5 of A237677.

%H R. H. Hardin, <a href="/A237676/b237676.txt">Table of n, a(n) for n = 1..13</a>

%e Some solutions for n=1

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

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

%Y Cf. A237677.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 11 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 April 25 11:24 EDT 2024. Contains 371967 sequences. (Running on oeis4.)