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!)
A183852 Number of (n+1)X8 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others 1

%I

%S 29863,591211,10793131,265093125,6355114021,181527680767,

%T 5102345174752,154188934678551,4604277587760239,141296909019355751,

%U 4307449067043766425,132709859004874156095,4075563520087286739862,125698794388164258100562

%N Number of (n+1)X8 0..3 arrays with each element of every 2X2 subblock being the sum mod 4 of two others

%C Column 7 of A183854

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

%e Some solutions for 3X8

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 07 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 6 23:36 EDT 2022. Contains 357270 sequences. (Running on oeis4.)