The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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

%I

%S 0,6,40,122,488,1608,5392,17368,55232,172896,535296,1641376,4992896,

%T 15083648,45297408,135323008,402405376,1191699968,3516119040,

%U 10339711488,30313351168,88624646144,258445856768,751910639616,2182836600832

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

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

%F Empirical: a(n) = 6*a(n-1) - 6*a(n-2) - 16*a(n-3) + 12*a(n-4) + 24*a(n-5) + 8*a(n-6).

%F Empirical g.f.: 2*x^2*(1 - x)*(3 + 5*x - 36*x^2 + 10*x^3) / (1 - 2*x - 2*x^2)^3. - _Colin Barker_, Sep 20 2018

%e Some solutions for n=3:

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

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

%Y Row 2 of A229637.

%K nonn

%O 1,2

%A _R. H. Hardin_, Sep 27 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 February 17 02:22 EST 2020. Contains 331976 sequences. (Running on oeis4.)