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!)
A229589 Number of defective 3-colorings of a 4 X n 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. 1
0, 224, 2160, 19764, 167364, 1375152, 11035044, 87040260, 677327004, 5213798784, 39777273072, 301217858676, 2266655495148, 16964398022220, 126372108661164, 937513290523896, 6929886363153768, 51058923535878660, 375112065125492964 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row 4 of A229586.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

FORMULA

Empirical: a(n) = 18*a(n-1) - 111*a(n-2) + 282*a(n-3) - 333*a(n-4) + 180*a(n-5) - 36*a(n-6) for n > 12.

EXAMPLE

Some solutions for n=3:

  0 1 0   0 0 1   0 1 0   0 1 0   0 1 0   0 1 2   0 0 1

  2 2 1   2 0 1   2 2 0   2 2 1   0 2 2   2 0 2   1 0 2

  1 0 1   1 2 1   0 2 1   0 2 0   0 1 2   1 0 1   2 1 2

  2 0 2   0 2 0   0 2 1   0 2 0   2 0 2   2 2 0   0 1 0

CROSSREFS

Cf. A229586.

Sequence in context: A233869 A146745 A015048 * A341048 A232804 A032802

Adjacent sequences:  A229586 A229587 A229588 * A229590 A229591 A229592

KEYWORD

nonn

AUTHOR

R. H. Hardin, Sep 26 2013

STATUS

approved

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 January 28 18:56 EST 2022. Contains 350657 sequences. (Running on oeis4.)