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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229505 Number of defective 3-colorings of an n X 3 0..2 array connected diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. 1
 0, 48, 480, 4032, 31104, 228096, 1617408, 11197440, 76142592, 510603264, 3386105856, 22251552768, 145118822400, 940369969152, 6060162023424, 38868625391616, 248257671856128, 1579821548175360, 10020582391283712 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Column 3 of A229510 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 12*a(n-1) - 36*a(n-2) for n>3. Conjectures from Colin Barker, Jun 16 2017: (Start) G.f.: 48*x^2*(1 - 2*x) / (1 - 6*x)^2. a(n) = 2^(2+n)*3^(n-2)*(2*n - 1) for n>1. (End) EXAMPLE Some solutions for n=4 ..0..0..1....0..1..2....0..1..1....0..1..0....0..1..2....0..1..0....0..1..0 ..2..2..2....2..1..2....2..2..0....0..2..0....0..1..0....2..2..2....2..1..2 ..0..1..1....0..1..0....0..1..1....1..1..0....1..1..2....1..0..0....1..0..2 ..1..2..0....1..2..2....2..2..1....0..2..1....0..0..2....1..2..0....2..0..1 CROSSREFS Sequence in context: A287762 A309599 A305571 * A299785 A299787 A168351 Adjacent sequences: A229502 A229503 A229504 * A229506 A229507 A229508 KEYWORD nonn AUTHOR R. H. Hardin, Sep 25 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 13 00:40 EDT 2024. Contains 375857 sequences. (Running on oeis4.)