The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229601 Number of defective 3-colorings of an n X 3 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order. 1

%I #7 Sep 19 2018 15:14:29

%S 1,39,396,3040,20714,131345,792929,4618048,26165860,145058507,

%T 790042315,4239980962,22473980838,117862612005,612450538677,

%U 3156938117780,16157454978232,82173962646319,415564115855215,2090880090793526

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

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

%F Empirical: a(n) = 15*a(n-1) - 81*a(n-2) + 185*a(n-3) - 162*a(n-4) + 60*a(n-5) - 8*a(n-6) for n>7.

%F Empirical g.f.: x*(1 + 24*x - 108*x^2 + 74*x^3 + 137*x^4 - 127*x^5 + 8*x^6) / (1 - 5*x + 2*x^2)^3. - _Colin Barker_, Sep 19 2018

%e Some solutions for n=3:

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

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

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

%Y Column 3 of A229606.

%K nonn

%O 1,2

%A _R. H. Hardin_, Sep 26 2013

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.

Last modified December 6 01:58 EST 2023. Contains 367594 sequences. (Running on oeis4.)