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 A229688 #10 Apr 28 2021 01:25:33 %S A229688 0,3,626,80757,17724789,7551515197,6749642728251,13137498602431137, %T A229688 56959853494513069323,558086310754870843057446, %U A229688 12478933741531750768879884477,641265228914623466199892311965220 %N A229688 Number of defective 3-colorings of an n X n 0..2 array connected horizontally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. %C A229688 Diagonal of A229694. %e A229688 Some solutions for n=3: %e A229688 0 1 2 0 1 0 0 1 0 0 1 0 0 1 2 0 0 1 0 1 0 %e A229688 0 2 0 2 2 1 1 2 1 0 2 2 2 0 0 0 2 0 1 0 1 %e A229688 1 2 2 0 0 1 2 0 2 0 2 1 0 1 0 1 2 1 1 0 2 %K A229688 nonn,more %O A229688 1,2 %A A229688 _R. H. Hardin_, Sep 27 2013