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

%I #8 Oct 28 2014 03:40:33

%S 563,11205,221994,4552617,93224611,1918085364,39451935691,

%T 811987649749,16711113378122,343953320541489,7079284019757859,

%U 145708327358170052,2999015488433549923,61726799222630392869,1270482524400967939690

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

%C Column 2 of A237035.

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

%F Empirical: a(n) = 22*a(n-1) +31*a(n-2) -1351*a(n-3) +2166*a(n-4) +3313*a(n-5) -5940*a(n-6) +1760*a(n-7).

%e Some solutions for n=2:

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

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

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

%Y Cf. A237035.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 02 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 September 18 07:05 EDT 2024. Contains 375996 sequences. (Running on oeis4.)