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

 

Logo


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

%I

%S 0,36,888,10896,108000,959040,7952256,62892288,480370176,3571983360,

%T 26000455680,185993957376,1311390425088,9133778681856,62952545157120,

%U 429958047006720,2913266164432896,19601071637004288,131057481860775936

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

%C Column 3 of A229685.

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

%F Empirical: a(n) = 18*a(n-1) -108*a(n-2) +216*a(n-3) for n>4.

%F Empirical: G.f. 12*x^2*(10*x+1)*(10*x-3) / (6*x-1)^3. - _R. J. Mathar_, Sep 29 2013

%F Empirical a(n) = 2^n*3^(n-3)*(-45 + 4*n + 16*n^2) for n>1. - _Colin Barker_, Jun 16 2017

%e Some solutions for n=3

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

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

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

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 04:54 EDT 2020. Contains 337295 sequences. (Running on oeis4.)