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 A229682 #12 Apr 28 2021 01:22:34 %S A229682 0,2688,108000,2700432,58038768,1138164048,21063718224,373936700880, %T A229682 6435143958672,108084508966224,1780281966880656,28856162624878800, %U A229682 461471700766361616,7295948004100520016,114218818672804436880 %N A229682 Number of defective 3-colorings of an n X 5 0..2 array connected diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. %C A229682 Column 5 of A229685. %H A229682 R. H. Hardin, <a href="/A229682/b229682.txt">Table of n, a(n) for n = 1..210</a> %F A229682 Empirical: a(n) = 45*a(n-1) - 675*a(n-2) + 2565*a(n-3) + 25272*a(n-4) - 211410*a(n-5) + 3805380*a(n-7) - 8188128*a(n-8) - 14959080*a(n-9) + 70858800*a(n-10) - 85030560*a(n-11) + 34012224*a(n-12) for n > 13. %F A229682 Empirical g.f.: 48*x^2*(56 - 270*x - 7191*x^2 + 52596*x^3 + 88749*x^4 - 1358532*x^5 + 992412*x^6 + 10940832*x^7 - 16886556*x^8 - 22289904*x^9 + 58471632*x^10 - 30233088*x^11) / ((1 - 15*x + 18*x^2)^3*(1 - 18*x^2)^3). - _Colin Barker_, Jun 16 2017 %e A229682 Some solutions for n=3: %e A229682 0 1 0 0 1 0 1 2 1 1 0 1 2 2 2 0 1 2 1 1 %e A229682 1 2 2 2 2 0 0 2 0 0 1 1 1 1 0 2 1 2 2 2 %e A229682 0 2 1 1 1 1 1 2 2 1 2 2 0 2 0 0 1 2 1 0 %K A229682 nonn %O A229682 1,2 %A A229682 _R. H. Hardin_, Sep 27 2013