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

%I

%S 35,429,9557,448665,40482339,9808052813,5102345174752,

%T 6963325147796767,21046774704680367392,146145472233705207996377,

%U 2243552020457712284374333510

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

%C Diagonal of A183854

%e Some solutions for 3X3

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

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

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

%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 3 08:00 EDT 2022. Contains 355031 sequences. (Running on oeis4.)