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 A206233 #8 Jun 14 2018 09:19:33 %S A206233 310,1136,4456,27168,133392,607008,3503136,17206032,78302496, %T A206233 451903008,2219576592,10101020448,58295486496,286325378832, %U A206233 1303031636256,7520117756448,36935973867792,168091081075488,970095190580256 %N A206233 Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order. %C A206233 Column 3 of A206238. %H A206233 R. H. Hardin, <a href="/A206233/b206233.txt">Table of n, a(n) for n = 1..210</a> %F A206233 Empirical: a(n) = a(n-1) + 129*a(n-3) - 129*a(n-4) for n>7. %F A206233 Empirical g.f.: 2*x*(155 + 413*x + 1660*x^2 - 8639*x^3 - 165*x^4 + 22668*x^5 - 16860*x^6) / ((1 - x)*(1 - 129*x^3)). - _Colin Barker_, Jun 14 2018 %e A206233 Some solutions for n=4: %e A206233 ..0..1..2..0....0..0..1..0....0..0..1..0....0..0..1..1....0..0..1..0 %e A206233 ..3..2..2..0....0..1..0..0....2..0..0..2....1..1..0..1....2..0..0..1 %e A206233 ..2..2..1..2....1..0..0..1....3..1..0..0....2..1..1..0....3..1..0..0 %e A206233 ..2..1..2..2....0..0..2..3....3..3..1..0....1..2..1..1....3..3..1..0 %e A206233 ..3..2..2..3....1..1..3..3....1..3..3..1....1..1..0..0....0..3..3..1 %Y A206233 Cf. A206238. %K A206233 nonn %O A206233 1,1 %A A206233 _R. H. Hardin_, Feb 05 2012