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.

A229585 Number of defective 3-colorings of an n X 7 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 A229585 #8 Apr 27 2021 21:18:00
%S A229585 96,5724,264300,11035044,435326724,16551428868,613195191972,
%T A229585 22285439501940,798023885879412,28242628279003332,990013172442084324,
%U A229585 34429588531063458516,1189375483329032617620,40853134231990887545316
%N A229585 Number of defective 3-colorings of an n X 7 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
%C A229585 Column 7 of A229586.
%H A229585 R. H. Hardin, <a href="/A229585/b229585.txt">Table of n, a(n) for n = 1..210</a>
%F A229585 Empirical: a(n) = 84*a(n-1) - 2466*a(n-2) + 31428*a(n-3) - 206469*a(n-4) + 750384*a(n-5) - 1513404*a(n-6) + 1574640*a(n-7) - 656100*a(n-8).
%e A229585 Some solutions for n=3:
%e A229585   0 1 2 0 1 0 2      0 1 0 2 1 2 1      0 1 2 0 1 0 1
%e A229585   0 1 2 0 2 1 0      0 1 0 2 1 2 1      0 1 2 0 1 0 1
%e A229585   2 1 2 1 2 1 1      0 2 0 2 1 2 2      0 2 1 0 2 0 2
%Y A229585 Cf. A229586.
%K A229585 nonn
%O A229585 1,1
%A A229585 _R. H. Hardin_, Sep 26 2013