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 A277764 #4 Oct 29 2016 07:28:07 %S A277764 0,80,1989,275018,20049229,1762881313,145416104585,12253138042478, %T A277764 1025207978301185,85977721285058269,7204885193038036176, %U A277764 603918178598058203435,50616585384840289440801,4242477668915521353604820 %N A277764 Number of nX5 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2. %C A277764 Column 5 of A277767. %H A277764 R. H. Hardin, <a href="/A277764/b277764.txt">Table of n, a(n) for n = 1..210</a> %e A277764 Some solutions for n=3 %e A277764 ..0..1..2..0..2. .0..1..2..0..1. .0..1..2..0..1. .0..1..0..2..0 %e A277764 ..2..0..2..1..1. .2..0..0..2..2. .2..0..2..0..2. .2..2..0..1..1 %e A277764 ..2..1..0..0..2. .1..2..1..0..1. .1..2..1..1..2. .0..1..1..2..0 %Y A277764 Cf. A277767. %K A277764 nonn %O A277764 1,2 %A A277764 _R. H. Hardin_, Oct 29 2016