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

%I #4 Feb 17 2014 12:30:48

%S 256,14456,1781008,336372000,182752988334,220851136586828,

%T 747061315866664736,5370193055761518144212

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

%C Diagonal of A238081

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 17 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 16 04:17 EDT 2024. Contains 371696 sequences. (Running on oeis4.)