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 A229599 #9 Apr 27 2021 21:25:11 %S A229599 0,6,396,35182,5655616,1840258874,1279020266434,1956482857537638, %T A229599 6709261067536603464,52210936089708881164828, %U A229599 929873887535519786302080272,38136664055521875662056947040494 %N A229599 Number of defective 3-colorings of an n X n 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order. %C A229599 Diagonal of A229606. %e A229599 Some solutions for n=3: %e A229599 0 1 1 0 0 1 0 1 0 0 1 0 0 1 0 0 1 1 0 1 2 %e A229599 1 0 0 1 1 2 0 2 1 1 2 2 0 2 2 0 2 0 2 2 1 %e A229599 2 1 2 0 2 1 0 1 2 0 2 0 1 0 1 1 0 1 2 0 2 %Y A229599 Cf. A229606. %K A229599 nonn %O A229599 1,2 %A A229599 _R. H. Hardin_, Sep 26 2013