cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A229583 #9 Sep 19 2018 15:14:55
%S A229583 16,444,9156,167364,2865780,47091780,752194836,11768185764,
%T A229583 181223769204,2756144066436,41496027416532,619575164338788,
%U A229583 9186393069102132,135397538308042308,1985403434065601940,28983255427638399780
%N 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.
%H A229583 R. H. Hardin, <a href="/A229583/b229583.txt">Table of n, a(n) for n = 1..210</a>
%F A229583 Empirical: a(n) = 30*a(n-1) - 261*a(n-2) + 540*a(n-3) - 324*a(n-4).
%F A229583 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
%e A229583 Some solutions for n=3:
%e A229583 ..0..1..0..2..1....0..1..0..1..0....0..1..0..1..0....0..1..0..1..0
%e A229583 ..0..1..1..2..1....0..1..2..1..2....0..1..0..2..1....0..1..2..1..1
%e A229583 ..0..2..0..2..1....0..0..2..1..2....2..1..1..2..0....0..1..0..2..0
%Y A229583 Column 5 of A229586.
%K A229583 nonn
%O A229583 1,1
%A A229583 _R. H. Hardin_, Sep 26 2013