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

%I #8 Apr 05 2018 06:32:07

%S 127,823,5323,35755,237671,1598975,10698847,71897239,482007015,

%T 3236765167,21714088791,145764796623,978116447511,6565074294447,

%U 44057430220231,295694291697375,1984444048131639,13318411681021391

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

%C Column 2 of A183836.

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

%F Empirical: a(n) = 8*a(n-1) + 7*a(n-2) - 142*a(n-3) + 246*a(n-4) + 68*a(n-5) - 386*a(n-6) + 176*a(n-7) + 24*a(n-8).

%F Empirical g.f.: x*(127 - 193*x - 2150*x^2 + 5444*x^3 - 6*x^4 - 7906*x^5 + 4160*x^6 + 552*x^7) / ((1 - x)*(1 - 7*x - 14*x^2 + 128*x^3 - 118*x^4 - 186*x^5 + 200*x^6 + 24*x^7)). - _Colin Barker_, Apr 05 2018

%e Some solutions for 5 X 3:

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

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

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

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

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

%Y Cf. A183836.

%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 24 10:37 EDT 2024. Contains 374583 sequences. (Running on oeis4.)