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 A262325 #5 Sep 18 2015 07:31:22 %S A262325 2,5,90,2399,570922,394241389,1456404454010,19392931688071671, %T A262325 1134083007177482717802,256890679674803015904974405, %U A262325 239672757231397671662393429466490 %N A262325 Number of (n+1)X(n+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits. %C A262325 Diagonal of A262332. %H A262325 R. H. Hardin, <a href="/A262325/b262325.txt">Table of n, a(n) for n = 1..12</a> %e A262325 Some solutions for n=4 %e A262325 ..1..1..0..1..1....0..0..0..0..0....0..0..1..1..0....1..0..0..1..0 %e A262325 ..0..1..0..0..1....1..0..0..1..0....0..1..1..1..1....0..1..1..1..1 %e A262325 ..1..0..0..1..0....1..0..0..1..0....0..0..0..1..1....0..0..0..0..0 %e A262325 ..0..0..0..0..0....0..0..0..0..0....0..0..1..1..0....1..0..0..1..0 %e A262325 ..1..0..0..1..0....0..0..0..0..0....0..1..1..0..0....0..1..1..1..1 %Y A262325 Cf. A262332. %K A262325 nonn %O A262325 1,1 %A A262325 _R. H. Hardin_, Sep 18 2015