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 A233106 #11 Feb 19 2018 11:01:46 %S A233106 1,2,6,23,99,452,2136,10313,50469,249062,1235466,6147803,30650439, %T A233106 152986472,764135196,3818284493,19084248009,95399716682,476934013326, %U A233106 2384476356383,11921800651179,59607259863692,298031069141856 %N A233106 Number of n X 1 0..5 arrays with no element x(i,j) adjacent to value 5-x(i,j) horizontally or vertically, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order. %C A233106 Column 1 of A233113. %H A233106 R. H. Hardin, <a href="/A233106/b233106.txt">Table of n, a(n) for n = 1..210</a> %F A233106 Empirical: a(n) = 9*a(n-1) - 23*a(n-2) + 15*a(n-3). %F A233106 Conjectures from _Colin Barker_, Feb 19 2018: (Start) %F A233106 G.f.: x*(1 - 7*x + 11*x^2) / ((1 - x)*(1 - 3*x)*(1 - 5*x)). %F A233106 a(n) = (75 + 10*3^n + 3*5^n) / 120. %F A233106 (End) %e A233106 Some solutions for n=7: %e A233106 ..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0 %e A233106 ..1....1....0....0....1....0....1....1....1....0....1....1....0....1....0....1 %e A233106 ..2....2....0....1....5....1....5....2....1....1....5....5....1....0....1....2 %e A233106 ..1....4....1....5....1....5....2....0....1....5....1....5....2....4....2....5 %e A233106 ..5....0....1....1....1....4....0....3....5....5....1....1....1....2....1....5 %e A233106 ..1....2....2....0....2....5....3....5....1....2....1....0....5....4....3....2 %e A233106 ..5....2....0....1....5....4....1....2....0....5....5....0....2....2....3....5 %K A233106 nonn %O A233106 1,2 %A A233106 _R. H. Hardin_, Dec 04 2013