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.
%I A229642 #10 Apr 28 2021 01:22:53 %S A229642 0,3924,50084,747299,11485716,170405645,2495874984,35693194243, %T A229642 503332240292,6990933433009,96001895136772,1304362116389856, %U A229642 17565879194817688,234673938451844201,3113368949256998744 %N A229642 Number of defective 3-colorings of a 6 X n 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. %C A229642 Row 6 of A229637. %H A229642 R. H. Hardin, <a href="/A229642/b229642.txt">Table of n, a(n) for n = 1..210</a> %H A229642 R. H. Hardin, <a href="/A229642/a229642.txt">Empirical recurrence of order 69</a> %F A229642 Empirical recurrence of order 69 (see link above). %e A229642 Some solutions for n=3: %e A229642 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1 0 %e A229642 2 1 2 2 1 2 2 1 0 2 1 2 0 1 0 0 2 1 1 2 1 %e A229642 2 1 0 1 1 0 2 0 1 1 0 1 2 0 2 0 1 0 1 0 1 %e A229642 2 1 0 0 2 0 2 0 1 1 0 1 1 0 2 2 1 0 2 0 2 %e A229642 1 2 0 1 2 0 1 0 1 1 0 2 1 0 1 2 1 0 2 1 2 %e A229642 0 2 1 0 2 1 2 0 1 1 0 2 2 0 1 0 1 0 2 0 2 %K A229642 nonn %O A229642 1,2 %A A229642 _R. H. Hardin_, Sep 27 2013