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!)
A229695 Number of defective 3-colorings of a 2Xn 0..2 array connected horizontally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order 1

%I #6 Sep 28 2013 18:45:57

%S 0,3,43,245,1171,5077,20691,80757,305235,1125333,4067091,14461173,

%T 50723091,175867605,603736659,2054728053,6940088019,23284024533,

%U 77651501715,257577229557,850273182099,2794463987157,9147385165779

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

%C Row 2 of A229694

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

%F Empirical: a(n) = 9*a(n-1) -27*a(n-2) +27*a(n-3) for n>6.

%F Empirical: G.f. 3*x^2+43*x^3 -x^4*(245-1034*x+1153*x^2) / (3*x-1)^3. - _R. J. Mathar_, Sep 29 2013

%e Some solutions for n=3

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

%e ..0..0..1....0..0..2....1..1..0....1..0..1....1..2..2....2..0..0....2..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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 11:37 EDT 2024. Contains 371936 sequences. (Running on oeis4.)