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

%I #4 Feb 17 2014 11:39:52

%S 256,16116,2296588,506608980,323819924384,448255641499780,

%T 1736639229342029538,13883769406039825746192

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

%C Diagonal of A238072

%e Some solutions for n=2

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

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

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

%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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)