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

%I

%S 1186,7562,49152,333508,2234136,14991412,100790676,681668756,

%T 4585208960,30833533736,207687511796,1402048789416,9438312729002,

%U 63517027029228,427982336753074,2886242240243372,19435769390492458,130855004505569972

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

%C Column 3 of A237703

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

%e Some solutions for n=3

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

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

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

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

%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 May 24 08:13 EDT 2022. Contains 354024 sequences. (Running on oeis4.)