This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229529 Number of defective 3-colorings of an n X 3 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. 1

%I

%S 2,8,58,356,2038,11184,59626,311260,1598974,8110984,40726290,

%T 202778804,1002549414,4926990688,24088644794,117243591052,

%U 568394827598,2745949068600,13224557927522,63511978473572,304253006899190

%N Number of defective 3-colorings of an n X 3 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

%H R. H. Hardin, <a href="/A229529/b229529.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 10*a(n-1) - 29*a(n-2) + 20*a(n-3) - 4*a(n-4) for n>5.

%F Empirical g.f.: 2*x*(1 - 6*x + 18*x^2 - 16*x^3 + 4*x^4) / (1 - 5*x + 2*x^2)^2. - _Colin Barker_, Sep 18 2018

%e Some solutions for n=4:

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

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

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

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

%Y Column 3 of A229534.

%K nonn

%O 1,1

%A _R. H. Hardin_, Sep 25 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 15 15:14 EDT 2019. Contains 328030 sequences. (Running on oeis4.)