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 A233177 #9 Jun 02 2025 08:51:53 %S A233177 48,896,96256,7938048,736362496,65265467392,5896922988544, %T A233177 528589678182400,47540804020862976,4269747110598934528, %U A233177 383704462840431640576,34473222428763411709952,3097514921527666217582592 %N A233177 Number of 4Xn 0..5 arrays with no element x(i,j) adjacent to itself or value 5-x(i,j) horizontally, diagonally or antidiagonally, top left element zero, and 1 appearing before 2 3 and 4, and 2 appearing before 3 in row major order (unlabeled 6-colorings with no clashing color pairs). %C A233177 Row 4 of A233174 %H A233177 R. H. Hardin, <a href="/A233177/b233177.txt">Table of n, a(n) for n = 1..210</a> %F A233177 Empirical: a(n) = 64*a(n-1) +3328*a(n-2) -77824*a(n-3) -1441792*a(n-4) +28311552*a(n-5) +33554432*a(n-6) -1073741824*a(n-7) for n>8 %e A233177 Some solutions for n=3 %e A233177 ..0..1..5....0..1..0....0..1..2....0..1..2....0..1..2....0..1..2....0..1..0 %e A233177 ..5..2..5....0..2..0....3..4..3....2..4..0....3..4..2....5..4..5....5..1..2 %e A233177 ..5..3..1....5..2..1....2..1..5....5..1..2....3..1..5....2..1..0....5..4..2 %e A233177 ..4..2..0....1..2..1....3..4..2....3..1..2....0..1..3....2..1..3....5..1..5 %K A233177 nonn %O A233177 1,1 %A A233177 _R. H. Hardin_, Dec 05 2013