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!)
A237008 Number of (n+1)X(1+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal 1

%I #5 Feb 02 2014 07:53:52

%S 256,704,1936,5984,18496,61472,204304,712352,2483776,8957984,32307856,

%T 119454944,441672256,1663878752,6268205584,23952380192,91528031296,

%U 353581084064,1365915788176,5320845079904,20727040868416,81257847595232

%N Number of (n+1)X(1+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal

%C Column 1 of A237015

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

%F Empirical: a(n) = 8*a(n-1) +16*a(n-2) -268*a(n-3) +189*a(n-4) +3388*a(n-5) -5824*a(n-6) -20048*a(n-7) +49756*a(n-8) +52752*a(n-9) -196896*a(n-10) -24192*a(n-11) +369216*a(n-12) -131328*a(n-13) -262656*a(n-14) +165888*a(n-15)

%e Some solutions for n=5

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

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

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

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

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

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

%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 April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)