login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237333 Number of (n+1)X(1+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal 1

%I

%S 256,1980,15082,120808,972356,7935194,65088736,536949612,4446049514,

%T 36942292664,307835761076,2571906893178,21538160121328,

%U 180756078794140,1519926867217162,12803364991634568,108025697029512484

%N Number of (n+1)X(1+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock equal

%C Column 1 of A237340

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

%F Empirical: a(n) = 15*a(n-1) -17*a(n-2) -518*a(n-3) +1159*a(n-4) +5713*a(n-5) -11569*a(n-6) -22194*a(n-7) +35356*a(n-8) +29720*a(n-9) -34208*a(n-10) -11136*a(n-11) +7680*a(n-12)

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 06 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 14:26 EDT 2021. Contains 348090 sequences. (Running on oeis4.)