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

%I #4 Feb 18 2014 08:50:07

%S 10664,165780,2842692,51036456,961463420,18066348584,345494546192,

%T 6395305423256,122012216692790,2294811925941656,43937555414461856,

%U 817171885471409680,15610406616306032674,292887836680612952740

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

%C Column 3 of A238155

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

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 18 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 14 01:31 EDT 2024. Contains 374290 sequences. (Running on oeis4.)