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

%I #5 Mar 31 2012 12:35:55

%S 92771,2568541,65461226,2373353909,84948077733,3637653147102,

%T 154188934678551,6963325147796767,312016957670582226,

%U 14275770710942816651,650555611278894371929,29856567303793299342810

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

%C Column 8 of A183854

%H R. H. Hardin, <a href="/A183853/b183853.txt">Table of n, a(n) for n = 1..149</a>

%e Some solutions for 3X9

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

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

%e ..2..0..2..2..2..2..2..2..0....0..2..0..0..0..2..0..0..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 July 17 05:50 EDT 2024. Contains 374360 sequences. (Running on oeis4.)