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

%I #4 Feb 17 2014 12:34:45

%S 378708,10449784,242829762,6222330452,182752988334,5032066269920,

%T 146517793924666,4129457221662176,123794073907866626,

%U 3439338548069808556,100765370412350781048,2845050207107323105908,85214590014028631785528

%N Number of (n+1)X(5+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 Column 5 of A238081

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

%e Some solutions for n=1

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

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

%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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)