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!)
A184495 Number of (n+1)X8 0..2 arrays with every 2X2 subblock sum greater than 4 1

%I #5 Mar 31 2012 12:36:00

%S 482071,285552669,102612963762,45743024168833,18774737574888647,

%T 7976784799815632924,3342508236591318287277,1408627940819572965700159,

%U 592259493074168177309718080,249253664489899615321425709119

%N Number of (n+1)X8 0..2 arrays with every 2X2 subblock sum greater than 4

%C Column 7 of A184497

%H R. H. Hardin, <a href="/A184495/b184495.txt">Table of n, a(n) for n = 1..200</a>

%e Some solutions for 3X8

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 15 2011

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 October 2 02:58 EDT 2023. Contains 365831 sequences. (Running on oeis4.)