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!)
 A229583 Number of defective 3-colorings of an n X 5 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. 1
 16, 444, 9156, 167364, 2865780, 47091780, 752194836, 11768185764, 181223769204, 2756144066436, 41496027416532, 619575164338788, 9186393069102132, 135397538308042308, 1985403434065601940, 28983255427638399780 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS R. H. Hardin, Table of n, a(n) for n = 1..210 FORMULA Empirical: a(n) = 30*a(n-1) - 261*a(n-2) + 540*a(n-3) - 324*a(n-4). Empirical g.f.: 4*x*(4 - 9*x + 3*x^2 - 18*x^3) / (1 - 15*x + 18*x^2)^2. - Colin Barker, Sep 19 2018 EXAMPLE Some solutions for n=3: ..0..1..0..2..1....0..1..0..1..0....0..1..0..1..0....0..1..0..1..0 ..0..1..1..2..1....0..1..2..1..2....0..1..0..2..1....0..1..2..1..1 ..0..2..0..2..1....0..0..2..1..2....2..1..1..2..0....0..1..0..2..0 CROSSREFS Column 5 of A229586. Sequence in context: A075852 A260853 A068792 * A241077 A318937 A358569 Adjacent sequences: A229580 A229581 A229582 * A229584 A229585 A229586 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 21:20 EST 2023. Contains 367540 sequences. (Running on oeis4.)