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!)
A238175 Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the minimum of every 2X2 subblock equal 1

%I

%S 2329,69023,2027833,62220767,1917124097,59356544695,1839517772097,

%T 57041499462367,1769077034861049,54869963289748751,

%U 1701895480615144705,52788019393696146951,1637341717839368325985,50785983421267344740815

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

%C Column 3 of A238180

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

%F Empirical: a(n) = 49*a(n-1) -545*a(n-2) -1988*a(n-3) +54954*a(n-4) -146726*a(n-5) -976002*a(n-6) +4971928*a(n-7) -1809493*a(n-8) -23027443*a(n-9) +29412787*a(n-10) +29650212*a(n-11) -62209316*a(n-12) -2721808*a(n-13) +42539968*a(n-14) -8853248*a(n-15) -8996864*a(n-16) +2113536*a(n-17)

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 19 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 May 16 17:38 EDT 2022. Contains 353719 sequences. (Running on oeis4.)