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

%I

%S 9650,136894,1846987,31362526,515409762,9808052813,181527680767,

%T 3637653147102,71400670236377,1460353019415072,29473951514959991,

%U 607704516654872749,12431600718178381761,257173291746012588265

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

%C Column 6 of A183854

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

%e Some solutions for 3X7

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

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

%e ..2..2..2..0..0..0..2....3..3..2..3..1..3..1....2..3..3..1..1..3..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 September 29 22:05 EDT 2022. Contains 357092 sequences. (Running on oeis4.)