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

%I #4 Feb 04 2014 05:36:36

%S 1868,37652,762508,16547988,367558796,8327731884,190715003652,

%T 4398267676604,101855057140548,2364789226002900,54988238070630044,

%U 1279827071158817828,29804114720736509244,694301197214817879804

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

%C Column 2 of A237158

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

%F Empirical: a(n) = 55*a(n-1) -1035*a(n-2) +6857*a(n-3) +16166*a(n-4) -418194*a(n-5) +1564374*a(n-6) +1495550*a(n-7) -20565065*a(n-8) +35087663*a(n-9) +12182197*a(n-10) -64353607*a(n-11) +12508772*a(n-12) +36204908*a(n-13) -9872064*a(n-14) -5608640*a(n-15) +1752064*a(n-16)

%e Some solutions for n=2

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

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

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

%K nonn

%O 1,1

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