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 A229533 #10 Apr 27 2021 21:18:48 %S A229533 96,1152,33136,833108,19965136,463976296,10551803060,236116939092, %T A229533 5217401278606,114127296405752,2475805502937114,53336234719117660, %U A229533 1142245246463418470,24337955479727680972,516277243352142049170 %N A229533 Number of defective 3-colorings of an n X 7 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. %C A229533 Column 7 of A229534. %H A229533 R. H. Hardin, <a href="/A229533/b229533.txt">Table of n, a(n) for n = 1..210</a> %F A229533 Empirical: a(n) = 82*a(n-1) - 2779*a(n-2) + 50254*a(n-3) - 514677*a(n-4) + 2743554*a(n-5) - 2950648*a(n-6) - 48609034*a(n-7) + 245316224*a(n-8) - 89432156*a(n-9) - 2444502643*a(n-10) + 5704858072*a(n-11) + 7254972423*a(n-12) - 41716035658*a(n-13) + 18035762825*a(n-14) + 132606292618*a(n-15) - 178302990168*a(n-16) - 171928095488*a(n-17) + 491624257303*a(n-18) - 70904009836*a(n-19) - 621985038704*a(n-20) + 477824279660*a(n-21) + 281672875548*a(n-22) - 522707244404*a(n-23) + 119050620101*a(n-24) + 190519380818*a(n-25) - 140300285301*a(n-26) + 10246766686*a(n-27) + 24709126330*a(n-28) - 9478840252*a(n-29) - 368991021*a(n-30) + 964165580*a(n-31) - 172681320*a(n-32) - 20355920*a(n-33) + 9906636*a(n-34) - 719568*a(n-35) - 120720*a(n-36) + 22272*a(n-37) - 1024*a(n-38) for n > 39. %e A229533 Some solutions for n=3: %e A229533 0 1 2 2 0 2 0 0 1 0 1 0 2 1 0 1 0 2 2 1 0 %e A229533 0 1 0 1 0 2 0 0 1 0 1 0 1 0 0 1 0 1 0 1 2 %e A229533 2 1 0 2 0 2 0 0 1 0 2 0 1 2 2 1 0 1 0 1 2 %Y A229533 Cf. A229534. %K A229533 nonn %O A229533 1,1 %A A229533 _R. H. Hardin_, Sep 25 2013